./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:23:35,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:23:35,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:23:35,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:23:35,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:23:35,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:23:35,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:23:35,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:23:35,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:23:35,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:23:35,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:23:35,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:23:35,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:23:35,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:23:35,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:23:35,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:23:35,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:23:35,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:23:35,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:23:35,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:23:35,887 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:23:35,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:23:35,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:23:35,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:23:35,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:23:35,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:23:35,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:23:35,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:23:35,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:23:35,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:23:35,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:23:35,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:23:35,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:23:35,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:23:35,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:23:35,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:23:35,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:23:35,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:23:35,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:23:35,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:23:35,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:23:35,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:23:35,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:23:35,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:23:35,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:23:35,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:23:35,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:23:35,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:23:35,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:23:35,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:23:35,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:23:35,940 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:23:35,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:23:35,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:23:35,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:23:35,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:23:35,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:23:35,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:23:35,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:23:35,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:23:35,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:23:35,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:23:35,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:23:35,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:23:35,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:23:35,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:23:35,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:23:35,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:23:35,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:23:35,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:23:35,944 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:23:35,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:23:35,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:23:35,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 [2022-07-22 22:23:36,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:23:36,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:23:36,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:23:36,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:23:36,170 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:23:36,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-07-22 22:23:36,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b017dd1/172b9db2ebcb4d028ac91c671b743a1b/FLAGd6e50b045 [2022-07-22 22:23:36,954 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:23:36,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-07-22 22:23:36,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b017dd1/172b9db2ebcb4d028ac91c671b743a1b/FLAGd6e50b045 [2022-07-22 22:23:37,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b017dd1/172b9db2ebcb4d028ac91c671b743a1b [2022-07-22 22:23:37,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:23:37,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:23:37,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:23:37,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:23:37,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:23:37,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:23:37" (1/1) ... [2022-07-22 22:23:37,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f731691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:37, skipping insertion in model container [2022-07-22 22:23:37,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:23:37" (1/1) ... [2022-07-22 22:23:37,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:23:37,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:23:37,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2022-07-22 22:23:37,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2022-07-22 22:23:37,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:37,994 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:37,994 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:37,995 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:37,996 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,006 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,007 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,008 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,009 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,010 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,012 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,012 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,299 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:23:38,302 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:23:38,303 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:23:38,305 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:23:38,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:23:38,307 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:23:38,308 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:23:38,308 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:23:38,317 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:23:38,319 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:23:38,479 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:23:38,829 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,829 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,846 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,848 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,853 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,854 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,868 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,869 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,871 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,871 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,871 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:23:38,940 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:23:38,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2022-07-22 22:23:38,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2022-07-22 22:23:38,996 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,997 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,997 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,998 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:38,998 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,006 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,007 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,007 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,007 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,008 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,009 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,009 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,009 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,056 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:23:39,057 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:23:39,057 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:23:39,058 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:23:39,059 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:23:39,059 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:23:39,059 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:23:39,061 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:23:39,062 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:23:39,062 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:23:39,081 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:23:39,155 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,156 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,173 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,173 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,175 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,176 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:39,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:23:39,437 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:23:39,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39 WrapperNode [2022-07-22 22:23:39,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:23:39,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:23:39,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:23:39,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:23:39,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,633 INFO L137 Inliner]: procedures = 775, calls = 2489, calls flagged for inlining = 67, calls inlined = 21, statements flattened = 1294 [2022-07-22 22:23:39,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:23:39,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:23:39,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:23:39,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:23:39,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:23:39,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:23:39,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:23:39,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:23:39,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (1/1) ... [2022-07-22 22:23:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:23:39,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:39,816 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-22 22:23:39,824 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-22 22:23:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 22:23:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:23:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:23:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:23:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-22 22:23:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-22 22:23:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:23:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:23:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2022-07-22 22:23:39,859 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2022-07-22 22:23:39,859 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-22 22:23:39,859 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-22 22:23:39,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:23:39,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:23:39,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:23:39,859 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-07-22 22:23:39,860 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-07-22 22:23:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:23:39,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:23:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:23:39,860 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:23:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-22 22:23:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-22 22:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-22 22:23:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-22 22:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-22 22:23:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-22 22:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:23:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:23:39,862 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:23:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:23:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-22 22:23:39,862 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-22 22:23:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-22 22:23:39,862 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-22 22:23:39,863 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-07-22 22:23:39,863 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-07-22 22:23:39,863 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-22 22:23:39,863 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-22 22:23:39,863 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-22 22:23:39,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-22 22:23:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:23:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-22 22:23:39,867 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-22 22:23:39,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-22 22:23:39,867 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-07-22 22:23:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-07-22 22:23:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-22 22:23:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-22 22:23:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-22 22:23:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-22 22:23:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-22 22:23:39,873 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-22 22:23:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-22 22:23:39,874 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-22 22:23:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-22 22:23:39,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:23:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:23:39,874 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-22 22:23:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-22 22:23:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:23:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-22 22:23:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-22 22:23:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-22 22:23:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-22 22:23:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-22 22:23:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-22 22:23:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-07-22 22:23:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-07-22 22:23:39,876 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-07-22 22:23:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-07-22 22:23:39,876 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 22:23:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 22:23:39,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:23:40,256 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:23:40,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:23:40,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-22 22:23:40,482 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-22 22:23:41,018 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-07-22 22:23:41,018 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-07-22 22:23:41,514 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:23:41,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:23:41,522 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-22 22:23:41,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:23:41 BoogieIcfgContainer [2022-07-22 22:23:41,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:23:41,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:23:41,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:23:41,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:23:41,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:23:37" (1/3) ... [2022-07-22 22:23:41,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c10a4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:23:41, skipping insertion in model container [2022-07-22 22:23:41,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:39" (2/3) ... [2022-07-22 22:23:41,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c10a4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:23:41, skipping insertion in model container [2022-07-22 22:23:41,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:23:41" (3/3) ... [2022-07-22 22:23:41,532 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2022-07-22 22:23:41,546 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:23:41,546 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:23:41,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:23:41,620 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@157b9b59, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1908b622 [2022-07-22 22:23:41,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:23:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 232 states have internal predecessors, (299), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-22 22:23:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-22 22:23:41,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:41,637 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:41,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:41,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash -322226588, now seen corresponding path program 1 times [2022-07-22 22:23:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:41,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794756092] [2022-07-22 22:23:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:42,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794756092] [2022-07-22 22:23:42,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-22 22:23:42,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467526807] [2022-07-22 22:23:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:42,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:42,267 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-22 22:23:42,274 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-22 22:23:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:42,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 22:23:42,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-22 22:23:42,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467526807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:42,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:42,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:23:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283376958] [2022-07-22 22:23:42,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:42,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 22:23:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 22:23:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:23:42,973 INFO L87 Difference]: Start difference. First operand has 349 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 232 states have internal predecessors, (299), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 22:23:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:43,050 INFO L93 Difference]: Finished difference Result 692 states and 983 transitions. [2022-07-22 22:23:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 22:23:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2022-07-22 22:23:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:43,064 INFO L225 Difference]: With dead ends: 692 [2022-07-22 22:23:43,064 INFO L226 Difference]: Without dead ends: 341 [2022-07-22 22:23:43,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:23:43,079 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:43,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:23:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-22 22:23:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-22 22:23:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-07-22 22:23:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 451 transitions. [2022-07-22 22:23:43,145 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 451 transitions. Word has length 124 [2022-07-22 22:23:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:43,146 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 451 transitions. [2022-07-22 22:23:43,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 22:23:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 451 transitions. [2022-07-22 22:23:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-22 22:23:43,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:43,149 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:43,173 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-22 22:23:43,358 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-22 22:23:43,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash -672164438, now seen corresponding path program 1 times [2022-07-22 22:23:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:43,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036048834] [2022-07-22 22:23:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:43,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:23:43,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576533047] [2022-07-22 22:23:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:43,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:43,439 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-22 22:23:43,440 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-22 22:23:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:44,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:23:44,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-22 22:23:44,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:44,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036048834] [2022-07-22 22:23:44,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:23:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576533047] [2022-07-22 22:23:44,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576533047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:44,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:44,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:23:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321474390] [2022-07-22 22:23:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:23:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:23:44,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:23:44,228 INFO L87 Difference]: Start difference. First operand 341 states and 451 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-22 22:23:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:44,633 INFO L93 Difference]: Finished difference Result 668 states and 883 transitions. [2022-07-22 22:23:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:23:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 124 [2022-07-22 22:23:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:44,640 INFO L225 Difference]: With dead ends: 668 [2022-07-22 22:23:44,641 INFO L226 Difference]: Without dead ends: 341 [2022-07-22 22:23:44,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:23:44,645 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 465 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:44,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1184 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:23:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-22 22:23:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-22 22:23:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 224 states have (on average 1.25) internal successors, (280), 226 states have internal predecessors, (280), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-07-22 22:23:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 450 transitions. [2022-07-22 22:23:44,684 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 450 transitions. Word has length 124 [2022-07-22 22:23:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:44,688 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 450 transitions. [2022-07-22 22:23:44,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-22 22:23:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 450 transitions. [2022-07-22 22:23:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-22 22:23:44,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:44,698 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:44,729 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-22 22:23:44,915 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-22 22:23:44,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1014015400, now seen corresponding path program 1 times [2022-07-22 22:23:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:44,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552528256] [2022-07-22 22:23:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:44,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:23:44,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094732795] [2022-07-22 22:23:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:44,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:44,994 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-22 22:23:45,015 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-22 22:23:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:45,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 22:23:45,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-22 22:23:45,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:45,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552528256] [2022-07-22 22:23:45,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:23:45,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094732795] [2022-07-22 22:23:45,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094732795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:45,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:45,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:23:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012812997] [2022-07-22 22:23:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:45,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:23:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:23:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:23:45,614 INFO L87 Difference]: Start difference. First operand 341 states and 450 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 22:23:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:45,664 INFO L93 Difference]: Finished difference Result 678 states and 899 transitions. [2022-07-22 22:23:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:23:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2022-07-22 22:23:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:45,668 INFO L225 Difference]: With dead ends: 678 [2022-07-22 22:23:45,668 INFO L226 Difference]: Without dead ends: 346 [2022-07-22 22:23:45,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:23:45,671 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 2 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:45,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:23:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-22 22:23:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-07-22 22:23:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 228 states have (on average 1.2456140350877194) internal successors, (284), 230 states have internal predecessors, (284), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2022-07-22 22:23:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 458 transitions. [2022-07-22 22:23:45,711 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 458 transitions. Word has length 124 [2022-07-22 22:23:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:45,711 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 458 transitions. [2022-07-22 22:23:45,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-22 22:23:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 458 transitions. [2022-07-22 22:23:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-22 22:23:45,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:45,714 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:45,744 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-22 22:23:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:45,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2006309942, now seen corresponding path program 1 times [2022-07-22 22:23:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489381383] [2022-07-22 22:23:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:23:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:23:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:23:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-22 22:23:46,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:46,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489381383] [2022-07-22 22:23:46,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489381383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:46,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:46,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 22:23:46,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834749431] [2022-07-22 22:23:46,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:46,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:23:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:46,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:23:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:23:46,591 INFO L87 Difference]: Start difference. First operand 346 states and 458 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-22 22:23:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:49,931 INFO L93 Difference]: Finished difference Result 754 states and 1012 transitions. [2022-07-22 22:23:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 22:23:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 130 [2022-07-22 22:23:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:49,935 INFO L225 Difference]: With dead ends: 754 [2022-07-22 22:23:49,946 INFO L226 Difference]: Without dead ends: 429 [2022-07-22 22:23:49,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:23:49,949 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 284 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:49,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1902 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-22 22:23:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-22 22:23:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 349. [2022-07-22 22:23:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 230 states have (on average 1.2434782608695651) internal successors, (286), 233 states have internal predecessors, (286), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2022-07-22 22:23:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 461 transitions. [2022-07-22 22:23:49,975 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 461 transitions. Word has length 130 [2022-07-22 22:23:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 461 transitions. [2022-07-22 22:23:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-22 22:23:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 461 transitions. [2022-07-22 22:23:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 22:23:49,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:49,978 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:49,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:23:49,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1092762838, now seen corresponding path program 1 times [2022-07-22 22:23:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:49,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261388750] [2022-07-22 22:23:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:23:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:23:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:23:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:23:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:23:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 22:23:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261388750] [2022-07-22 22:23:50,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261388750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:23:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757169750] [2022-07-22 22:23:50,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:50,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:50,416 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-22 22:23:50,417 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-22 22:23:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:50,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 22:23:50,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:51,805 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-22 22:23:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-22 22:23:57,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:57,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757169750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:57,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:23:57,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-22 22:23:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427708059] [2022-07-22 22:23:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:57,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:23:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:23:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-22 22:23:57,788 INFO L87 Difference]: Start difference. First operand 349 states and 461 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-22 22:23:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:58,645 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2022-07-22 22:23:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:23:58,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 136 [2022-07-22 22:23:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:58,657 INFO L225 Difference]: With dead ends: 681 [2022-07-22 22:23:58,658 INFO L226 Difference]: Without dead ends: 351 [2022-07-22 22:23:58,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-22 22:23:58,660 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 5 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:58,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2408 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 630 Unchecked, 0.7s Time] [2022-07-22 22:23:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-22 22:23:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-07-22 22:23:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 232 states have (on average 1.2413793103448276) internal successors, (288), 234 states have internal predecessors, (288), 86 states have call successors, (86), 31 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2022-07-22 22:23:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 463 transitions. [2022-07-22 22:23:58,681 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 463 transitions. Word has length 136 [2022-07-22 22:23:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:58,682 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 463 transitions. [2022-07-22 22:23:58,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-22 22:23:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 463 transitions. [2022-07-22 22:23:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-22 22:23:58,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:58,685 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:23:58,716 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-22 22:23:58,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:58,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1043141135, now seen corresponding path program 1 times [2022-07-22 22:23:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237930266] [2022-07-22 22:23:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:23:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:23:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:23:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:23:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:23:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 22:23:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-22 22:23:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:59,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237930266] [2022-07-22 22:23:59,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237930266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:59,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:59,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:23:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076497416] [2022-07-22 22:23:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:23:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:23:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:23:59,425 INFO L87 Difference]: Start difference. First operand 351 states and 463 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 22:24:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:01,304 INFO L93 Difference]: Finished difference Result 739 states and 993 transitions. [2022-07-22 22:24:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:24:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-07-22 22:24:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:01,308 INFO L225 Difference]: With dead ends: 739 [2022-07-22 22:24:01,308 INFO L226 Difference]: Without dead ends: 433 [2022-07-22 22:24:01,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:24:01,310 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 470 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:01,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1559 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 22:24:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-22 22:24:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 353. [2022-07-22 22:24:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 233 states have (on average 1.240343347639485) internal successors, (289), 236 states have internal predecessors, (289), 86 states have call successors, (86), 31 states have call predecessors, (86), 33 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2022-07-22 22:24:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 469 transitions. [2022-07-22 22:24:01,338 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 469 transitions. Word has length 141 [2022-07-22 22:24:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:01,338 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 469 transitions. [2022-07-22 22:24:01,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 22:24:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2022-07-22 22:24:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-22 22:24:01,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:01,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:01,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:24:01,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1171893452, now seen corresponding path program 1 times [2022-07-22 22:24:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:01,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321906383] [2022-07-22 22:24:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:24:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 22:24:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-22 22:24:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:01,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321906383] [2022-07-22 22:24:01,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321906383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:01,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:01,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:24:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772157508] [2022-07-22 22:24:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:01,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:24:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:01,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:24:01,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:24:01,971 INFO L87 Difference]: Start difference. First operand 353 states and 469 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-22 22:24:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:03,507 INFO L93 Difference]: Finished difference Result 441 states and 597 transitions. [2022-07-22 22:24:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:24:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2022-07-22 22:24:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:03,510 INFO L225 Difference]: With dead ends: 441 [2022-07-22 22:24:03,510 INFO L226 Difference]: Without dead ends: 439 [2022-07-22 22:24:03,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:24:03,511 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 489 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:03,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1333 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-22 22:24:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-22 22:24:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 357. [2022-07-22 22:24:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 239 states have internal predecessors, (292), 86 states have call successors, (86), 32 states have call predecessors, (86), 34 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2022-07-22 22:24:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2022-07-22 22:24:03,531 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 146 [2022-07-22 22:24:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:03,532 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2022-07-22 22:24:03,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-22 22:24:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2022-07-22 22:24:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-22 22:24:03,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:03,534 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:03,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:24:03,534 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1112780077, now seen corresponding path program 1 times [2022-07-22 22:24:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:03,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521440485] [2022-07-22 22:24:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:24:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 22:24:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 22:24:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:24:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-22 22:24:04,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:04,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521440485] [2022-07-22 22:24:04,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521440485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:04,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:04,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:24:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555892873] [2022-07-22 22:24:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:04,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:24:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:24:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:24:04,077 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-22 22:24:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:06,227 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2022-07-22 22:24:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:24:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2022-07-22 22:24:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:06,230 INFO L225 Difference]: With dead ends: 447 [2022-07-22 22:24:06,230 INFO L226 Difference]: Without dead ends: 445 [2022-07-22 22:24:06,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:24:06,231 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 249 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:06,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1422 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 22:24:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-22 22:24:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 362. [2022-07-22 22:24:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 239 states have (on average 1.2343096234309623) internal successors, (295), 243 states have internal predecessors, (295), 87 states have call successors, (87), 33 states have call predecessors, (87), 35 states have return successors, (95), 85 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-22 22:24:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 477 transitions. [2022-07-22 22:24:06,251 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 477 transitions. Word has length 159 [2022-07-22 22:24:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:06,252 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 477 transitions. [2022-07-22 22:24:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-22 22:24:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 477 transitions. [2022-07-22 22:24:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-22 22:24:06,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:06,254 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:06,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:24:06,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1110933035, now seen corresponding path program 1 times [2022-07-22 22:24:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639704037] [2022-07-22 22:24:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:24:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 22:24:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 22:24:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:24:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-22 22:24:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639704037] [2022-07-22 22:24:06,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639704037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:06,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:06,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:24:06,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990104462] [2022-07-22 22:24:06,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:06,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:24:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:24:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:24:06,719 INFO L87 Difference]: Start difference. First operand 362 states and 477 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-22 22:24:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:08,581 INFO L93 Difference]: Finished difference Result 450 states and 605 transitions. [2022-07-22 22:24:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:24:08,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2022-07-22 22:24:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:08,584 INFO L225 Difference]: With dead ends: 450 [2022-07-22 22:24:08,584 INFO L226 Difference]: Without dead ends: 448 [2022-07-22 22:24:08,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:24:08,585 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 248 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:08,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1438 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 22:24:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-22 22:24:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 361. [2022-07-22 22:24:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 239 states have (on average 1.2343096234309623) internal successors, (295), 242 states have internal predecessors, (295), 86 states have call successors, (86), 33 states have call predecessors, (86), 35 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2022-07-22 22:24:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 475 transitions. [2022-07-22 22:24:08,604 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 475 transitions. Word has length 159 [2022-07-22 22:24:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:08,604 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 475 transitions. [2022-07-22 22:24:08,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-22 22:24:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 475 transitions. [2022-07-22 22:24:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-22 22:24:08,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:08,607 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:08,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:24:08,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1362509639, now seen corresponding path program 1 times [2022-07-22 22:24:08,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:08,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029967727] [2022-07-22 22:24:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:24:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 22:24:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 22:24:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-22 22:24:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:08,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029967727] [2022-07-22 22:24:08,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029967727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:08,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:08,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:24:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73090399] [2022-07-22 22:24:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:08,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:24:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:24:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:24:08,984 INFO L87 Difference]: Start difference. First operand 361 states and 475 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-22 22:24:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:10,683 INFO L93 Difference]: Finished difference Result 805 states and 1098 transitions. [2022-07-22 22:24:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:24:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 178 [2022-07-22 22:24:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:10,687 INFO L225 Difference]: With dead ends: 805 [2022-07-22 22:24:10,687 INFO L226 Difference]: Without dead ends: 513 [2022-07-22 22:24:10,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:24:10,689 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 635 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:10,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1632 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 22:24:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-22 22:24:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 402. [2022-07-22 22:24:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 269 states have (on average 1.2490706319702602) internal successors, (336), 273 states have internal predecessors, (336), 96 states have call successors, (96), 34 states have call predecessors, (96), 36 states have return successors, (105), 94 states have call predecessors, (105), 94 states have call successors, (105) [2022-07-22 22:24:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 537 transitions. [2022-07-22 22:24:10,712 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 537 transitions. Word has length 178 [2022-07-22 22:24:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:10,713 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 537 transitions. [2022-07-22 22:24:10,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-22 22:24:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 537 transitions. [2022-07-22 22:24:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-22 22:24:10,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:10,715 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:10,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 22:24:10,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1099401581, now seen corresponding path program 1 times [2022-07-22 22:24:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:10,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040248854] [2022-07-22 22:24:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:24:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:24:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 22:24:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-22 22:24:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040248854] [2022-07-22 22:24:11,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040248854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:11,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:11,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:24:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041332314] [2022-07-22 22:24:11,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:11,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:24:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:24:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:24:11,281 INFO L87 Difference]: Start difference. First operand 402 states and 537 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-22 22:24:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:14,349 INFO L93 Difference]: Finished difference Result 1011 states and 1427 transitions. [2022-07-22 22:24:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:24:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 174 [2022-07-22 22:24:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:14,354 INFO L225 Difference]: With dead ends: 1011 [2022-07-22 22:24:14,354 INFO L226 Difference]: Without dead ends: 691 [2022-07-22 22:24:14,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:24:14,356 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 573 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 3260 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 3610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 3260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:14,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2957 Invalid, 3610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 3260 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-22 22:24:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-22 22:24:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 449. [2022-07-22 22:24:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 303 states have (on average 1.2607260726072607) internal successors, (382), 308 states have internal predecessors, (382), 105 states have call successors, (105), 37 states have call predecessors, (105), 40 states have return successors, (118), 103 states have call predecessors, (118), 103 states have call successors, (118) [2022-07-22 22:24:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 605 transitions. [2022-07-22 22:24:14,382 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 605 transitions. Word has length 174 [2022-07-22 22:24:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:14,382 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 605 transitions. [2022-07-22 22:24:14,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-22 22:24:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 605 transitions. [2022-07-22 22:24:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-22 22:24:14,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:14,385 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 22:24:14,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -73198679, now seen corresponding path program 1 times [2022-07-22 22:24:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:14,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031136757] [2022-07-22 22:24:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 22:24:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 22:24:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 22:24:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-22 22:24:14,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:14,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031136757] [2022-07-22 22:24:14,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031136757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:14,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:14,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:24:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324786946] [2022-07-22 22:24:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:14,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:24:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:24:14,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:24:14,856 INFO L87 Difference]: Start difference. First operand 449 states and 605 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 22:24:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:18,549 INFO L93 Difference]: Finished difference Result 861 states and 1191 transitions. [2022-07-22 22:24:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 22:24:18,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 172 [2022-07-22 22:24:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:18,553 INFO L225 Difference]: With dead ends: 861 [2022-07-22 22:24:18,553 INFO L226 Difference]: Without dead ends: 583 [2022-07-22 22:24:18,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:24:18,555 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 359 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:18,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1586 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-22 22:24:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-07-22 22:24:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 449. [2022-07-22 22:24:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 303 states have (on average 1.2475247524752475) internal successors, (378), 308 states have internal predecessors, (378), 105 states have call successors, (105), 37 states have call predecessors, (105), 40 states have return successors, (118), 103 states have call predecessors, (118), 103 states have call successors, (118) [2022-07-22 22:24:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 601 transitions. [2022-07-22 22:24:18,581 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 601 transitions. Word has length 172 [2022-07-22 22:24:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:18,581 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 601 transitions. [2022-07-22 22:24:18,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 22:24:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 601 transitions. [2022-07-22 22:24:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-22 22:24:18,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:18,584 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 22:24:18,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1732239655, now seen corresponding path program 1 times [2022-07-22 22:24:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:18,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259474172] [2022-07-22 22:24:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 22:24:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:19,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 22:24:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 22:24:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-22 22:24:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:19,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259474172] [2022-07-22 22:24:19,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259474172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:19,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:19,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:24:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997626917] [2022-07-22 22:24:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:19,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:24:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:24:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:24:19,058 INFO L87 Difference]: Start difference. First operand 449 states and 601 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 22:24:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:22,114 INFO L93 Difference]: Finished difference Result 784 states and 1122 transitions. [2022-07-22 22:24:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:24:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-07-22 22:24:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:22,118 INFO L225 Difference]: With dead ends: 784 [2022-07-22 22:24:22,118 INFO L226 Difference]: Without dead ends: 709 [2022-07-22 22:24:22,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:24:22,120 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 469 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:22,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1674 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-22 22:24:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-07-22 22:24:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 457. [2022-07-22 22:24:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 309 states have (on average 1.2427184466019416) internal successors, (384), 314 states have internal predecessors, (384), 105 states have call successors, (105), 37 states have call predecessors, (105), 42 states have return successors, (122), 105 states have call predecessors, (122), 103 states have call successors, (122) [2022-07-22 22:24:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 611 transitions. [2022-07-22 22:24:22,148 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 611 transitions. Word has length 172 [2022-07-22 22:24:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:22,148 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 611 transitions. [2022-07-22 22:24:22,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 22:24:22,149 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 611 transitions. [2022-07-22 22:24:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-22 22:24:22,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:22,151 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:22,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 22:24:22,151 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1482232862, now seen corresponding path program 1 times [2022-07-22 22:24:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:22,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368415398] [2022-07-22 22:24:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:24:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:24:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 22:24:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 22:24:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 22:24:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-22 22:24:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:22,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368415398] [2022-07-22 22:24:22,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368415398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:24:22,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24843323] [2022-07-22 22:24:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:24:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:24:22,852 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-22 22:24:22,882 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-22 22:24:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:23,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 2784 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-22 22:24:23,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:24:23,559 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-22 22:24:23,562 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-22 22:24:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-22 22:24:23,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:24:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-07-22 22:24:24,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24843323] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:24:24,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:24:24,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 19 [2022-07-22 22:24:24,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485368920] [2022-07-22 22:24:24,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:24:24,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 22:24:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 22:24:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:24:24,080 INFO L87 Difference]: Start difference. First operand 457 states and 611 transitions. Second operand has 19 states, 16 states have (on average 6.4375) internal successors, (103), 14 states have internal predecessors, (103), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-07-22 22:24:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:27,479 INFO L93 Difference]: Finished difference Result 966 states and 1329 transitions. [2022-07-22 22:24:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 22:24:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.4375) internal successors, (103), 14 states have internal predecessors, (103), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) Word has length 178 [2022-07-22 22:24:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:27,483 INFO L225 Difference]: With dead ends: 966 [2022-07-22 22:24:27,483 INFO L226 Difference]: Without dead ends: 615 [2022-07-22 22:24:27,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 22:24:27,485 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 507 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:27,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 3345 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-22 22:24:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-22 22:24:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 473. [2022-07-22 22:24:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 316 states have (on average 1.2373417721518987) internal successors, (391), 321 states have internal predecessors, (391), 113 states have call successors, (113), 38 states have call predecessors, (113), 43 states have return successors, (128), 113 states have call predecessors, (128), 111 states have call successors, (128) [2022-07-22 22:24:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 632 transitions. [2022-07-22 22:24:27,513 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 632 transitions. Word has length 178 [2022-07-22 22:24:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:27,514 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 632 transitions. [2022-07-22 22:24:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.4375) internal successors, (103), 14 states have internal predecessors, (103), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-07-22 22:24:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 632 transitions. [2022-07-22 22:24:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-22 22:24:27,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:27,516 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:27,544 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-22 22:24:27,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 22:24:27,732 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1434896197, now seen corresponding path program 1 times [2022-07-22 22:24:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:27,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617943655] [2022-07-22 22:24:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:24:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 22:24:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 22:24:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-22 22:24:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:28,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617943655] [2022-07-22 22:24:28,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617943655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:28,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 22:24:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483228088] [2022-07-22 22:24:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:28,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:24:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:24:28,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:24:28,346 INFO L87 Difference]: Start difference. First operand 473 states and 632 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-22 22:24:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:31,442 INFO L93 Difference]: Finished difference Result 1059 states and 1490 transitions. [2022-07-22 22:24:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 22:24:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 178 [2022-07-22 22:24:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:31,447 INFO L225 Difference]: With dead ends: 1059 [2022-07-22 22:24:31,448 INFO L226 Difference]: Without dead ends: 738 [2022-07-22 22:24:31,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-07-22 22:24:31,450 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 449 mSDsluCounter, 2848 mSDsCounter, 0 mSdLazyCounter, 3620 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 3814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:31,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 3297 Invalid, 3814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3620 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-22 22:24:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-07-22 22:24:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 494. [2022-07-22 22:24:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 327 states have (on average 1.2324159021406729) internal successors, (403), 332 states have internal predecessors, (403), 121 states have call successors, (121), 40 states have call predecessors, (121), 45 states have return successors, (138), 121 states have call predecessors, (138), 119 states have call successors, (138) [2022-07-22 22:24:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 662 transitions. [2022-07-22 22:24:31,480 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 662 transitions. Word has length 178 [2022-07-22 22:24:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:31,480 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 662 transitions. [2022-07-22 22:24:31,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-22 22:24:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 662 transitions. [2022-07-22 22:24:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-22 22:24:31,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:31,482 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:31,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 22:24:31,483 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549499, now seen corresponding path program 1 times [2022-07-22 22:24:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403662197] [2022-07-22 22:24:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 22:24:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 22:24:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 22:24:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-22 22:24:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:31,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403662197] [2022-07-22 22:24:31,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403662197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:31,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:24:31,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:24:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258125323] [2022-07-22 22:24:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:31,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:24:31,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:31,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:24:31,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:24:31,876 INFO L87 Difference]: Start difference. First operand 494 states and 662 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 22:24:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:35,531 INFO L93 Difference]: Finished difference Result 908 states and 1252 transitions. [2022-07-22 22:24:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:24:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2022-07-22 22:24:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:35,535 INFO L225 Difference]: With dead ends: 908 [2022-07-22 22:24:35,535 INFO L226 Difference]: Without dead ends: 630 [2022-07-22 22:24:35,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:24:35,537 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 283 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:35,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1166 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-22 22:24:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-07-22 22:24:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 496. [2022-07-22 22:24:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 329 states have (on average 1.2310030395136777) internal successors, (405), 334 states have internal predecessors, (405), 121 states have call successors, (121), 40 states have call predecessors, (121), 45 states have return successors, (138), 121 states have call predecessors, (138), 119 states have call successors, (138) [2022-07-22 22:24:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 664 transitions. [2022-07-22 22:24:35,566 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 664 transitions. Word has length 174 [2022-07-22 22:24:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:35,566 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 664 transitions. [2022-07-22 22:24:35,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 22:24:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 664 transitions. [2022-07-22 22:24:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-22 22:24:35,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:35,568 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:35,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 22:24:35,569 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash -167187636, now seen corresponding path program 1 times [2022-07-22 22:24:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546757823] [2022-07-22 22:24:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:24:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:24:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:24:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:24:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:24:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:24:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:24:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:24:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:24:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:24:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:24:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 22:24:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 22:24:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:24:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 22:24:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:24:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:24:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:24:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:24:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 22:24:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-22 22:24:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-22 22:24:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:24:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-22 22:24:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:24:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546757823] [2022-07-22 22:24:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546757823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:24:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437229460] [2022-07-22 22:24:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:36,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:24:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:24:36,819 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-22 22:24:36,821 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-22 22:24:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:24:37,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-22 22:24:37,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:24:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-22 22:24:37,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:24:37,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437229460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:24:37,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:24:37,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-07-22 22:24:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54236541] [2022-07-22 22:24:37,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:24:37,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:24:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:24:37,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:24:37,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:24:37,588 INFO L87 Difference]: Start difference. First operand 496 states and 664 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-07-22 22:24:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:24:37,841 INFO L93 Difference]: Finished difference Result 985 states and 1317 transitions. [2022-07-22 22:24:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:24:37,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 188 [2022-07-22 22:24:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:24:37,845 INFO L225 Difference]: With dead ends: 985 [2022-07-22 22:24:37,845 INFO L226 Difference]: Without dead ends: 498 [2022-07-22 22:24:37,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:24:37,848 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 30 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:24:37,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2392 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:24:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-07-22 22:24:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2022-07-22 22:24:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 330 states have (on average 1.2303030303030302) internal successors, (406), 336 states have internal predecessors, (406), 121 states have call successors, (121), 40 states have call predecessors, (121), 46 states have return successors, (139), 121 states have call predecessors, (139), 119 states have call successors, (139) [2022-07-22 22:24:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 666 transitions. [2022-07-22 22:24:37,875 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 666 transitions. Word has length 188 [2022-07-22 22:24:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:24:37,875 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 666 transitions. [2022-07-22 22:24:37,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-07-22 22:24:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 666 transitions. [2022-07-22 22:24:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-22 22:24:37,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:24:37,878 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:24:37,909 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-22 22:24:38,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 22:24:38,092 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:24:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:24:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash 464786715, now seen corresponding path program 1 times [2022-07-22 22:24:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:24:38,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798883689] [2022-07-22 22:24:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:24:38,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:24:38,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545135898] [2022-07-22 22:24:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:24:38,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:24:38,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:24:38,153 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-22 22:24:38,165 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-22 22:26:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:32,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 389 conjunts are in the unsatisfiable core [2022-07-22 22:26:32,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:26:33,003 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-22 22:26:33,330 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 22:26:33,331 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-22 22:26:33,391 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-22 22:26:33,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:26:33,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 22:26:33,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:26:34,235 INFO L356 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2022-07-22 22:26:34,235 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-22 22:26:35,191 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-22 22:26:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 119 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-22 22:26:36,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:26:37,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (not (<= 2 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3351) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3350) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|)) (+ 40 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3349) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|))) 18446744073709551616)))) is different from false [2022-07-22 22:26:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:26:37,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798883689] [2022-07-22 22:26:37,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:26:37,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545135898] [2022-07-22 22:26:37,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545135898] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:26:37,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:26:37,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-07-22 22:26:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747654070] [2022-07-22 22:26:37,825 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-22 22:26:37,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 22:26:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:26:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 22:26:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2101, Unknown=1, NotChecked=92, Total=2352 [2022-07-22 22:26:37,827 INFO L87 Difference]: Start difference. First operand 498 states and 666 transitions. Second operand has 34 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-22 22:26:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:26:39,269 INFO L93 Difference]: Finished difference Result 1034 states and 1367 transitions. [2022-07-22 22:26:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-22 22:26:39,269 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 194 [2022-07-22 22:26:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:26:39,272 INFO L225 Difference]: With dead ends: 1034 [2022-07-22 22:26:39,272 INFO L226 Difference]: Without dead ends: 530 [2022-07-22 22:26:39,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 221 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=167, Invalid=2188, Unknown=1, NotChecked=94, Total=2450 [2022-07-22 22:26:39,275 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 19 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5901 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2724 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:26:39,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5901 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 585 Invalid, 0 Unknown, 2724 Unchecked, 1.3s Time] [2022-07-22 22:26:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-22 22:26:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2022-07-22 22:26:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 350 states have (on average 1.22) internal successors, (427), 355 states have internal predecessors, (427), 125 states have call successors, (125), 48 states have call predecessors, (125), 52 states have return successors, (144), 124 states have call predecessors, (144), 123 states have call successors, (144) [2022-07-22 22:26:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 696 transitions. [2022-07-22 22:26:39,304 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 696 transitions. Word has length 194 [2022-07-22 22:26:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:26:39,304 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 696 transitions. [2022-07-22 22:26:39,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-22 22:26:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 696 transitions. [2022-07-22 22:26:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 22:26:39,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:26:39,306 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:26:39,393 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-22 22:26:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:26:39,528 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:26:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:26:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 554039209, now seen corresponding path program 1 times [2022-07-22 22:26:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:26:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334965030] [2022-07-22 22:26:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:26:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:26:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:26:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:26:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:26:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:26:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:26:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:26:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:26:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:26:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 22:26:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:26:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:26:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:26:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 22:26:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 22:26:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 22:26:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:26:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 22:26:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:26:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-22 22:26:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-22 22:26:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-22 22:26:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-22 22:26:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-22 22:26:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:26:40,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334965030] [2022-07-22 22:26:40,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334965030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:26:40,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:26:40,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:26:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004577357] [2022-07-22 22:26:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:26:40,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:26:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:26:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:26:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:26:40,020 INFO L87 Difference]: Start difference. First operand 528 states and 696 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-22 22:26:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:26:41,646 INFO L93 Difference]: Finished difference Result 1126 states and 1527 transitions. [2022-07-22 22:26:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:26:41,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2022-07-22 22:26:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:26:41,650 INFO L225 Difference]: With dead ends: 1126 [2022-07-22 22:26:41,650 INFO L226 Difference]: Without dead ends: 637 [2022-07-22 22:26:41,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:26:41,652 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 241 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:26:41,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1868 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 22:26:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-07-22 22:26:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 533. [2022-07-22 22:26:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 354 states have (on average 1.2175141242937852) internal successors, (431), 359 states have internal predecessors, (431), 125 states have call successors, (125), 48 states have call predecessors, (125), 53 states have return successors, (146), 125 states have call predecessors, (146), 123 states have call successors, (146) [2022-07-22 22:26:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 702 transitions. [2022-07-22 22:26:41,683 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 702 transitions. Word has length 200 [2022-07-22 22:26:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:26:41,684 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 702 transitions. [2022-07-22 22:26:41,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-22 22:26:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 702 transitions. [2022-07-22 22:26:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 22:26:41,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:26:41,686 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:26:41,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 22:26:41,686 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:26:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:26:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash -769130113, now seen corresponding path program 1 times [2022-07-22 22:26:41,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:26:41,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507112747] [2022-07-22 22:26:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:26:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:26:41,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:26:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853342414] [2022-07-22 22:26:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:26:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:26:41,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:26:41,748 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-22 22:26:41,753 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-22 22:26:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:42,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:26:42,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:26:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-22 22:26:42,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:26:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:26:42,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507112747] [2022-07-22 22:26:42,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:26:42,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853342414] [2022-07-22 22:26:42,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853342414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:26:42,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:26:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:26:42,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524485537] [2022-07-22 22:26:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:26:42,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:26:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:26:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:26:42,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:26:42,473 INFO L87 Difference]: Start difference. First operand 533 states and 702 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-22 22:26:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:26:42,499 INFO L93 Difference]: Finished difference Result 551 states and 719 transitions. [2022-07-22 22:26:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:26:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2022-07-22 22:26:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:26:42,500 INFO L225 Difference]: With dead ends: 551 [2022-07-22 22:26:42,500 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:26:42,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:26:42,502 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:26:42,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:26:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:26:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:26:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:26:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:26:42,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2022-07-22 22:26:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:26:42,504 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:26:42,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-22 22:26:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:26:42,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:26:42,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:26:42,539 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-22 22:26:42,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:26:42,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:26:44,514 INFO L902 garLoopResultBuilder]: At program point L7342(line 7342) the Hoare annotation is: true [2022-07-22 22:26:44,514 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsFINAL(lines 7331 7345) no Hoare annotation was computed. [2022-07-22 22:26:44,514 INFO L899 garLoopResultBuilder]: For program point L7339-1(line 7339) no Hoare annotation was computed. [2022-07-22 22:26:44,514 INFO L902 garLoopResultBuilder]: At program point L7339(line 7339) the Hoare annotation is: true [2022-07-22 22:26:44,514 INFO L899 garLoopResultBuilder]: For program point L7342-3(line 7342) no Hoare annotation was computed. [2022-07-22 22:26:44,515 INFO L899 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2022-07-22 22:26:44,515 INFO L902 garLoopResultBuilder]: At program point L7342-2(line 7342) the Hoare annotation is: true [2022-07-22 22:26:44,515 INFO L899 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2022-07-22 22:26:44,515 INFO L902 garLoopResultBuilder]: At program point L7342-1(line 7342) the Hoare annotation is: true [2022-07-22 22:26:44,515 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsEXIT(lines 7331 7345) no Hoare annotation was computed. [2022-07-22 22:26:44,515 INFO L899 garLoopResultBuilder]: For program point L7335-1(line 7335) no Hoare annotation was computed. [2022-07-22 22:26:44,515 INFO L902 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: true [2022-07-22 22:26:44,516 INFO L902 garLoopResultBuilder]: At program point L7337-1(line 7337) the Hoare annotation is: true [2022-07-22 22:26:44,516 INFO L902 garLoopResultBuilder]: At program point uninterpreted_equalsENTRY(lines 7331 7345) the Hoare annotation is: true [2022-07-22 22:26:44,516 INFO L902 garLoopResultBuilder]: At program point L7337(line 7337) the Hoare annotation is: true [2022-07-22 22:26:44,516 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-22 22:26:44,516 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 4)) (not (= (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 24)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-22 22:26:44,516 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 4)) (not (= (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 24)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0))))))) [2022-07-22 22:26:44,517 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-22 22:26:44,517 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-22 22:26:44,517 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_equalsENTRY(line 239) the Hoare annotation is: true [2022-07-22 22:26:44,517 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsFINAL(line 239) no Hoare annotation was computed. [2022-07-22 22:26:44,517 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsEXIT(line 239) no Hoare annotation was computed. [2022-07-22 22:26:44,517 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherEXIT(line 238) no Hoare annotation was computed. [2022-07-22 22:26:44,517 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_hasherENTRY(line 238) the Hoare annotation is: true [2022-07-22 22:26:44,518 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherFINAL(line 238) no Hoare annotation was computed. [2022-07-22 22:26:44,518 INFO L899 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2022-07-22 22:26:44,518 INFO L902 garLoopResultBuilder]: At program point L10008-4(line 10008) the Hoare annotation is: true [2022-07-22 22:26:44,518 INFO L899 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2022-07-22 22:26:44,518 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10006 10009) the Hoare annotation is: true [2022-07-22 22:26:44,518 INFO L899 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2022-07-22 22:26:44,518 INFO L899 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10006 10009) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10006 10009) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-07-22 22:26:44,519 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-07-22 22:26:44,520 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-07-22 22:26:44,520 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-07-22 22:26:44,521 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-07-22 22:26:44,521 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-07-22 22:26:44,522 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-07-22 22:26:44,522 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-07-22 22:26:44,522 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10119 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-22 22:26:44,522 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10119 10131) no Hoare annotation was computed. [2022-07-22 22:26:44,522 INFO L899 garLoopResultBuilder]: For program point L10126-1(line 10126) no Hoare annotation was computed. [2022-07-22 22:26:44,522 INFO L899 garLoopResultBuilder]: For program point L10126-2(lines 10126 10128) no Hoare annotation was computed. [2022-07-22 22:26:44,523 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (exists ((v_ArrVal_3300 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3300) |#valid|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (not (< 0 |#StackHeapBarrier|))) [2022-07-22 22:26:44,523 INFO L895 garLoopResultBuilder]: At program point L10126(line 10126) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= (* |hash_table_state_required_bytes_#in~size| 24) |hash_table_state_required_bytes_#t~mem1324|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_81| Int) (v_ArrVal_3300 Int) (v_ArrVal_3301 Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3300))) (and (= (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_81| v_ArrVal_3301) |#valid|) (= (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_81|) 0)))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|))) [2022-07-22 22:26:44,523 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10119 10131) no Hoare annotation was computed. [2022-07-22 22:26:44,523 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2022-07-22 22:26:44,523 INFO L899 garLoopResultBuilder]: For program point L10122-2(lines 10122 10124) no Hoare annotation was computed. [2022-07-22 22:26:44,523 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,523 INFO L902 garLoopResultBuilder]: At program point L6940(lines 6934 6941) the Hoare annotation is: true [2022-07-22 22:26:44,524 INFO L902 garLoopResultBuilder]: At program point L6936-2(line 6936) the Hoare annotation is: true [2022-07-22 22:26:44,524 INFO L899 garLoopResultBuilder]: For program point L6936-1(line 6936) no Hoare annotation was computed. [2022-07-22 22:26:44,524 INFO L902 garLoopResultBuilder]: At program point L6936(line 6936) the Hoare annotation is: true [2022-07-22 22:26:44,524 INFO L899 garLoopResultBuilder]: For program point L6937-1(lines 6937 6939) no Hoare annotation was computed. [2022-07-22 22:26:44,524 INFO L902 garLoopResultBuilder]: At program point L6937(lines 6937 6939) the Hoare annotation is: true [2022-07-22 22:26:44,524 INFO L899 garLoopResultBuilder]: For program point L6936-3(line 6936) no Hoare annotation was computed. [2022-07-22 22:26:44,524 INFO L899 garLoopResultBuilder]: For program point can_fail_callocEXIT(lines 6954 6958) no Hoare annotation was computed. [2022-07-22 22:26:44,525 INFO L899 garLoopResultBuilder]: For program point L6955-1(lines 6955 6957) no Hoare annotation was computed. [2022-07-22 22:26:44,525 INFO L902 garLoopResultBuilder]: At program point can_fail_callocENTRY(lines 6954 6958) the Hoare annotation is: true [2022-07-22 22:26:44,525 INFO L902 garLoopResultBuilder]: At program point L6955(line 6955) the Hoare annotation is: true [2022-07-22 22:26:44,525 INFO L899 garLoopResultBuilder]: For program point can_fail_callocFINAL(lines 6954 6958) no Hoare annotation was computed. [2022-07-22 22:26:44,525 INFO L899 garLoopResultBuilder]: For program point L6955-3(lines 6955 6957) no Hoare annotation was computed. [2022-07-22 22:26:44,525 INFO L902 garLoopResultBuilder]: At program point L2657(lines 2637 2658) the Hoare annotation is: true [2022-07-22 22:26:44,525 INFO L899 garLoopResultBuilder]: For program point L9210(lines 9210 9212) no Hoare annotation was computed. [2022-07-22 22:26:44,526 INFO L899 garLoopResultBuilder]: For program point L9202(lines 9202 9204) no Hoare annotation was computed. [2022-07-22 22:26:44,526 INFO L899 garLoopResultBuilder]: For program point L9210-2(lines 9210 9212) no Hoare annotation was computed. [2022-07-22 22:26:44,526 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-07-22 22:26:44,526 INFO L902 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: true [2022-07-22 22:26:44,526 INFO L899 garLoopResultBuilder]: For program point L9196(lines 9196 9198) no Hoare annotation was computed. [2022-07-22 22:26:44,526 INFO L899 garLoopResultBuilder]: For program point L9196-2(lines 9196 9198) no Hoare annotation was computed. [2022-07-22 22:26:44,526 INFO L899 garLoopResultBuilder]: For program point L2642(lines 2642 2644) no Hoare annotation was computed. [2022-07-22 22:26:44,527 INFO L899 garLoopResultBuilder]: For program point L2638(lines 2638 2641) no Hoare annotation was computed. [2022-07-22 22:26:44,527 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeEXIT(lines 9193 9218) no Hoare annotation was computed. [2022-07-22 22:26:44,527 INFO L902 garLoopResultBuilder]: At program point s_update_template_sizeENTRY(lines 9193 9218) the Hoare annotation is: true [2022-07-22 22:26:44,527 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeFINAL(lines 9193 9218) no Hoare annotation was computed. [2022-07-22 22:26:44,527 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6984 6987) no Hoare annotation was computed. [2022-07-22 22:26:44,527 INFO L902 garLoopResultBuilder]: At program point L6986(line 6986) the Hoare annotation is: true [2022-07-22 22:26:44,527 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6984 6987) the Hoare annotation is: true [2022-07-22 22:26:44,528 INFO L899 garLoopResultBuilder]: For program point L6986-1(line 6986) no Hoare annotation was computed. [2022-07-22 22:26:44,528 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6984 6987) no Hoare annotation was computed. [2022-07-22 22:26:44,528 INFO L902 garLoopResultBuilder]: At program point L9150-1(line 9150) the Hoare annotation is: true [2022-07-22 22:26:44,528 INFO L902 garLoopResultBuilder]: At program point s_hash_keys_eqENTRY(lines 9147 9155) the Hoare annotation is: true [2022-07-22 22:26:44,528 INFO L899 garLoopResultBuilder]: For program point L9150-2(line 9150) no Hoare annotation was computed. [2022-07-22 22:26:44,528 INFO L899 garLoopResultBuilder]: For program point s_hash_keys_eqEXIT(lines 9147 9155) no Hoare annotation was computed. [2022-07-22 22:26:44,528 INFO L902 garLoopResultBuilder]: At program point L9153(line 9153) the Hoare annotation is: true [2022-07-22 22:26:44,529 INFO L902 garLoopResultBuilder]: At program point L9154-1(line 9154) the Hoare annotation is: true [2022-07-22 22:26:44,529 INFO L899 garLoopResultBuilder]: For program point L9153-1(line 9153) no Hoare annotation was computed. [2022-07-22 22:26:44,529 INFO L899 garLoopResultBuilder]: For program point L9154-2(line 9154) no Hoare annotation was computed. [2022-07-22 22:26:44,529 INFO L902 garLoopResultBuilder]: At program point L9154-3(line 9154) the Hoare annotation is: true [2022-07-22 22:26:44,529 INFO L902 garLoopResultBuilder]: At program point L9150(line 9150) the Hoare annotation is: true [2022-07-22 22:26:44,529 INFO L899 garLoopResultBuilder]: For program point L9154-4(lines 9147 9155) no Hoare annotation was computed. [2022-07-22 22:26:44,530 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-22 22:26:44,530 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-22 22:26:44,530 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-22 22:26:44,530 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-22 22:26:44,530 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0)) (not (< 0 |#StackHeapBarrier|)) (and (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_81| Int) (v_ArrVal_3301 Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81| v_ArrVal_3301) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81|) 0))) (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0))) [2022-07-22 22:26:44,530 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-07-22 22:26:44,531 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-22 22:26:44,531 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|))) [2022-07-22 22:26:44,531 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:26:44,531 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:26:44,531 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:26:44,531 INFO L899 garLoopResultBuilder]: For program point L9115(line 9115) no Hoare annotation was computed. [2022-07-22 22:26:44,531 INFO L902 garLoopResultBuilder]: At program point L9115-1(lines 9100 9116) the Hoare annotation is: true [2022-07-22 22:26:44,532 INFO L899 garLoopResultBuilder]: For program point L9115-2(lines 9100 9116) no Hoare annotation was computed. [2022-07-22 22:26:44,532 INFO L902 garLoopResultBuilder]: At program point L9101(line 9101) the Hoare annotation is: true [2022-07-22 22:26:44,532 INFO L902 garLoopResultBuilder]: At program point L9101-1(line 9101) the Hoare annotation is: true [2022-07-22 22:26:44,532 INFO L899 garLoopResultBuilder]: For program point L9101-2(line 9101) no Hoare annotation was computed. [2022-07-22 22:26:44,532 INFO L902 garLoopResultBuilder]: At program point L7373-1(lines 7369 7374) the Hoare annotation is: true [2022-07-22 22:26:44,532 INFO L899 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2022-07-22 22:26:44,532 INFO L899 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2022-07-22 22:26:44,532 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-07-22 22:26:44,533 INFO L899 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2022-07-22 22:26:44,533 INFO L902 garLoopResultBuilder]: At program point s_hash_forENTRY(lines 9100 9116) the Hoare annotation is: true [2022-07-22 22:26:44,533 INFO L902 garLoopResultBuilder]: At program point L7370(lines 7370 7372) the Hoare annotation is: true [2022-07-22 22:26:44,533 INFO L899 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2022-07-22 22:26:44,533 INFO L899 garLoopResultBuilder]: For program point s_hash_forEXIT(lines 9100 9116) no Hoare annotation was computed. [2022-07-22 22:26:44,533 INFO L902 garLoopResultBuilder]: At program point L7370-1(lines 7370 7372) the Hoare annotation is: true [2022-07-22 22:26:44,534 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-22 22:26:44,534 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-22 22:26:44,534 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-22 22:26:44,534 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,534 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,534 INFO L902 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: true [2022-07-22 22:26:44,534 INFO L899 garLoopResultBuilder]: For program point L7356(line 7356) no Hoare annotation was computed. [2022-07-22 22:26:44,535 INFO L902 garLoopResultBuilder]: At program point L7350(lines 7350 7352) the Hoare annotation is: true [2022-07-22 22:26:44,535 INFO L902 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: true [2022-07-22 22:26:44,535 INFO L902 garLoopResultBuilder]: At program point L7353(lines 7353 7355) the Hoare annotation is: true [2022-07-22 22:26:44,535 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,535 INFO L899 garLoopResultBuilder]: For program point L7284(lines 7284 7286) no Hoare annotation was computed. [2022-07-22 22:26:44,535 INFO L902 garLoopResultBuilder]: At program point L7350-1(lines 7350 7352) the Hoare annotation is: true [2022-07-22 22:26:44,535 INFO L902 garLoopResultBuilder]: At program point L7281-1(lines 7281 7283) the Hoare annotation is: true [2022-07-22 22:26:44,536 INFO L902 garLoopResultBuilder]: At program point L7281(lines 7281 7283) the Hoare annotation is: true [2022-07-22 22:26:44,536 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,536 INFO L902 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: true [2022-07-22 22:26:44,536 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2022-07-22 22:26:44,536 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createEXIT(lines 9516 9580) no Hoare annotation was computed. [2022-07-22 22:26:44,536 INFO L899 garLoopResultBuilder]: For program point L9533(lines 9533 9539) no Hoare annotation was computed. [2022-07-22 22:26:44,536 INFO L899 garLoopResultBuilder]: For program point L9504(lines 9504 9507) no Hoare annotation was computed. [2022-07-22 22:26:44,536 INFO L899 garLoopResultBuilder]: For program point L9546(lines 9546 9561) no Hoare annotation was computed. [2022-07-22 22:26:44,537 INFO L902 garLoopResultBuilder]: At program point L9571(line 9571) the Hoare annotation is: true [2022-07-22 22:26:44,537 INFO L899 garLoopResultBuilder]: For program point L9571-1(line 9571) no Hoare annotation was computed. [2022-07-22 22:26:44,537 INFO L902 garLoopResultBuilder]: At program point L9513(lines 9484 9514) the Hoare annotation is: true [2022-07-22 22:26:44,537 INFO L899 garLoopResultBuilder]: For program point L9546-2(lines 9546 9561) no Hoare annotation was computed. [2022-07-22 22:26:44,537 INFO L899 garLoopResultBuilder]: For program point L9534-2(lines 9534 9536) no Hoare annotation was computed. [2022-07-22 22:26:44,537 INFO L899 garLoopResultBuilder]: For program point L9534(lines 9534 9536) no Hoare annotation was computed. [2022-07-22 22:26:44,537 INFO L902 garLoopResultBuilder]: At program point L9493(line 9493) the Hoare annotation is: true [2022-07-22 22:26:44,538 INFO L899 garLoopResultBuilder]: For program point L9493-1(line 9493) no Hoare annotation was computed. [2022-07-22 22:26:44,538 INFO L899 garLoopResultBuilder]: For program point L9493-2(lines 9493 9495) no Hoare annotation was computed. [2022-07-22 22:26:44,538 INFO L902 garLoopResultBuilder]: At program point L9497(line 9497) the Hoare annotation is: true [2022-07-22 22:26:44,538 INFO L899 garLoopResultBuilder]: For program point L9497-1(line 9497) no Hoare annotation was computed. [2022-07-22 22:26:44,538 INFO L902 garLoopResultBuilder]: At program point L9489(line 9489) the Hoare annotation is: true [2022-07-22 22:26:44,538 INFO L899 garLoopResultBuilder]: For program point L9489-1(line 9489) no Hoare annotation was computed. [2022-07-22 22:26:44,538 INFO L899 garLoopResultBuilder]: For program point L9489-2(lines 9489 9491) no Hoare annotation was computed. [2022-07-22 22:26:44,538 INFO L899 garLoopResultBuilder]: For program point L9543-2(lines 9543 9545) no Hoare annotation was computed. [2022-07-22 22:26:44,539 INFO L902 garLoopResultBuilder]: At program point L9506(line 9506) the Hoare annotation is: true [2022-07-22 22:26:44,539 INFO L902 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: true [2022-07-22 22:26:44,539 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-07-22 22:26:44,539 INFO L899 garLoopResultBuilder]: For program point L9502-1(lines 9502 9508) no Hoare annotation was computed. [2022-07-22 22:26:44,539 INFO L899 garLoopResultBuilder]: For program point L9531(line 9531) no Hoare annotation was computed. [2022-07-22 22:26:44,539 INFO L899 garLoopResultBuilder]: For program point L9502-3(lines 9502 9508) no Hoare annotation was computed. [2022-07-22 22:26:44,539 INFO L899 garLoopResultBuilder]: For program point L9498(lines 9498 9500) no Hoare annotation was computed. [2022-07-22 22:26:44,540 INFO L902 garLoopResultBuilder]: At program point L9502-4(lines 9502 9508) the Hoare annotation is: true [2022-07-22 22:26:44,540 INFO L899 garLoopResultBuilder]: For program point L9506-1(line 9506) no Hoare annotation was computed. [2022-07-22 22:26:44,540 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_createENTRY(lines 9516 9580) the Hoare annotation is: true [2022-07-22 22:26:44,540 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createFINAL(lines 9516 9580) no Hoare annotation was computed. [2022-07-22 22:26:44,540 INFO L902 garLoopResultBuilder]: At program point L9527-2(lines 9527 9529) the Hoare annotation is: true [2022-07-22 22:26:44,540 INFO L902 garLoopResultBuilder]: At program point L9523(line 9523) the Hoare annotation is: true [2022-07-22 22:26:44,540 INFO L899 garLoopResultBuilder]: For program point L9523-1(line 9523) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L899 garLoopResultBuilder]: For program point L9502-5(lines 9502 9508) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L899 garLoopResultBuilder]: For program point L9527(lines 9527 9529) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L899 garLoopResultBuilder]: For program point L9548(lines 9548 9551) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L899 garLoopResultBuilder]: For program point L9573(lines 9573 9575) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L899 garLoopResultBuilder]: For program point L9573-2(lines 9573 9575) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L902 garLoopResultBuilder]: At program point L9511(line 9511) the Hoare annotation is: true [2022-07-22 22:26:44,541 INFO L899 garLoopResultBuilder]: For program point L9511-1(line 9511) no Hoare annotation was computed. [2022-07-22 22:26:44,541 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10017 10064) the Hoare annotation is: true [2022-07-22 22:26:44,542 INFO L902 garLoopResultBuilder]: At program point L10045(line 10045) the Hoare annotation is: true [2022-07-22 22:26:44,542 INFO L899 garLoopResultBuilder]: For program point L10045-1(line 10045) no Hoare annotation was computed. [2022-07-22 22:26:44,542 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10017 10064) no Hoare annotation was computed. [2022-07-22 22:26:44,542 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10017 10064) no Hoare annotation was computed. [2022-07-22 22:26:44,542 INFO L899 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2022-07-22 22:26:44,542 INFO L899 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2022-07-22 22:26:44,542 INFO L902 garLoopResultBuilder]: At program point s_safe_eq_checkENTRY(lines 9121 9142) the Hoare annotation is: true [2022-07-22 22:26:44,543 INFO L899 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2022-07-22 22:26:44,543 INFO L902 garLoopResultBuilder]: At program point L9141(line 9141) the Hoare annotation is: true [2022-07-22 22:26:44,543 INFO L899 garLoopResultBuilder]: For program point L9141-1(line 9141) no Hoare annotation was computed. [2022-07-22 22:26:44,543 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkFINAL(lines 9121 9142) no Hoare annotation was computed. [2022-07-22 22:26:44,543 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkEXIT(lines 9121 9142) no Hoare annotation was computed. [2022-07-22 22:26:44,543 INFO L902 garLoopResultBuilder]: At program point L9173(line 9173) the Hoare annotation is: true [2022-07-22 22:26:44,543 INFO L899 garLoopResultBuilder]: For program point L9173-1(line 9173) no Hoare annotation was computed. [2022-07-22 22:26:44,544 INFO L899 garLoopResultBuilder]: For program point L9173-2(lines 9173 9177) no Hoare annotation was computed. [2022-07-22 22:26:44,544 INFO L902 garLoopResultBuilder]: At program point s_alloc_stateENTRY(lines 9171 9190) the Hoare annotation is: true [2022-07-22 22:26:44,544 INFO L902 garLoopResultBuilder]: At program point L7018(line 7018) the Hoare annotation is: true [2022-07-22 22:26:44,544 INFO L902 garLoopResultBuilder]: At program point L7020(lines 7001 7021) the Hoare annotation is: true [2022-07-22 22:26:44,544 INFO L899 garLoopResultBuilder]: For program point L7016-1(line 7016) no Hoare annotation was computed. [2022-07-22 22:26:44,544 INFO L902 garLoopResultBuilder]: At program point L7016(line 7016) the Hoare annotation is: true [2022-07-22 22:26:44,544 INFO L899 garLoopResultBuilder]: For program point L7018-1(line 7018) no Hoare annotation was computed. [2022-07-22 22:26:44,545 INFO L902 garLoopResultBuilder]: At program point L7010(line 7010) the Hoare annotation is: true [2022-07-22 22:26:44,545 INFO L899 garLoopResultBuilder]: For program point L7010-2(lines 7010 7014) no Hoare annotation was computed. [2022-07-22 22:26:44,545 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateEXIT(lines 9171 9190) no Hoare annotation was computed. [2022-07-22 22:26:44,545 INFO L899 garLoopResultBuilder]: For program point L7010-1(line 7010) no Hoare annotation was computed. [2022-07-22 22:26:44,545 INFO L902 garLoopResultBuilder]: At program point L7002(line 7002) the Hoare annotation is: true [2022-07-22 22:26:44,545 INFO L899 garLoopResultBuilder]: For program point L7004-1(line 7004) no Hoare annotation was computed. [2022-07-22 22:26:44,545 INFO L902 garLoopResultBuilder]: At program point L7004(line 7004) the Hoare annotation is: true [2022-07-22 22:26:44,545 INFO L899 garLoopResultBuilder]: For program point L9182(lines 9182 9186) no Hoare annotation was computed. [2022-07-22 22:26:44,546 INFO L899 garLoopResultBuilder]: For program point L7002-2(line 7002) no Hoare annotation was computed. [2022-07-22 22:26:44,546 INFO L902 garLoopResultBuilder]: At program point L7002-1(line 7002) the Hoare annotation is: true [2022-07-22 22:26:44,546 INFO L899 garLoopResultBuilder]: For program point L7017-2(lines 7017 7019) no Hoare annotation was computed. [2022-07-22 22:26:44,546 INFO L899 garLoopResultBuilder]: For program point L7017(lines 7017 7019) no Hoare annotation was computed. [2022-07-22 22:26:44,546 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateFINAL(lines 9171 9190) no Hoare annotation was computed. [2022-07-22 22:26:44,546 INFO L902 garLoopResultBuilder]: At program point L9437-1(line 9437) the Hoare annotation is: true [2022-07-22 22:26:44,546 INFO L899 garLoopResultBuilder]: For program point L9437-2(line 9437) no Hoare annotation was computed. [2022-07-22 22:26:44,547 INFO L902 garLoopResultBuilder]: At program point L9437-3(lines 9437 9439) the Hoare annotation is: true [2022-07-22 22:26:44,547 INFO L902 garLoopResultBuilder]: At program point L9478-5(lines 9433 9482) the Hoare annotation is: true [2022-07-22 22:26:44,547 INFO L899 garLoopResultBuilder]: For program point L9478-6(lines 9478 9481) no Hoare annotation was computed. [2022-07-22 22:26:44,547 INFO L902 garLoopResultBuilder]: At program point L9462-2(lines 9448 9476) the Hoare annotation is: true [2022-07-22 22:26:44,547 INFO L899 garLoopResultBuilder]: For program point L9462(lines 9462 9475) no Hoare annotation was computed. [2022-07-22 22:26:44,547 INFO L902 garLoopResultBuilder]: At program point s_emplace_itemENTRY(lines 9430 9482) the Hoare annotation is: true [2022-07-22 22:26:44,547 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemFINAL(lines 9430 9482) no Hoare annotation was computed. [2022-07-22 22:26:44,548 INFO L902 garLoopResultBuilder]: At program point L9434(line 9434) the Hoare annotation is: true [2022-07-22 22:26:44,548 INFO L902 garLoopResultBuilder]: At program point L9434-1(line 9434) the Hoare annotation is: true [2022-07-22 22:26:44,548 INFO L899 garLoopResultBuilder]: For program point L9434-2(line 9434) no Hoare annotation was computed. [2022-07-22 22:26:44,548 INFO L899 garLoopResultBuilder]: For program point L9464(lines 9464 9466) no Hoare annotation was computed. [2022-07-22 22:26:44,548 INFO L899 garLoopResultBuilder]: For program point L9464-2(lines 9464 9466) no Hoare annotation was computed. [2022-07-22 22:26:44,548 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemEXIT(lines 9430 9482) no Hoare annotation was computed. [2022-07-22 22:26:44,548 INFO L899 garLoopResultBuilder]: For program point L9448-1(lines 9448 9476) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9436(lines 9436 9440) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9436-1(lines 9436 9440) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9478-1(line 9478) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L902 garLoopResultBuilder]: At program point L9478-3(line 9478) the Hoare annotation is: true [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9478-4(line 9478) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9478(line 9478) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2022-07-22 22:26:44,549 INFO L899 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point s_find_entryFINAL(lines 9321 9346) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point s_find_entryEXIT(lines 9321 9346) no Hoare annotation was computed. [2022-07-22 22:26:44,550 INFO L902 garLoopResultBuilder]: At program point s_find_entryENTRY(lines 9321 9346) the Hoare annotation is: true [2022-07-22 22:26:44,550 INFO L899 garLoopResultBuilder]: For program point L9377-4(lines 9377 9380) no Hoare annotation was computed. [2022-07-22 22:26:44,551 INFO L899 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2022-07-22 22:26:44,551 INFO L899 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2022-07-22 22:26:44,551 INFO L902 garLoopResultBuilder]: At program point L9377-1(line 9377) the Hoare annotation is: true [2022-07-22 22:26:44,551 INFO L899 garLoopResultBuilder]: For program point L9377-2(line 9377) no Hoare annotation was computed. [2022-07-22 22:26:44,551 INFO L902 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: true [2022-07-22 22:26:44,551 INFO L902 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: true [2022-07-22 22:26:44,551 INFO L899 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2022-07-22 22:26:44,552 INFO L899 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2022-07-22 22:26:44,552 INFO L899 garLoopResultBuilder]: For program point L9337-4(lines 9337 9343) no Hoare annotation was computed. [2022-07-22 22:26:44,552 INFO L899 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2022-07-22 22:26:44,552 INFO L902 garLoopResultBuilder]: At program point L9337-1(line 9337) the Hoare annotation is: true [2022-07-22 22:26:44,552 INFO L899 garLoopResultBuilder]: For program point L9337-2(line 9337) no Hoare annotation was computed. [2022-07-22 22:26:44,552 INFO L899 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2022-07-22 22:26:44,552 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:26:44,553 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:26:44,553 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:26:44,553 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:26:44,553 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-22 22:26:44,553 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-22 22:26:44,553 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-22 22:26:44,553 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-22 22:26:44,553 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-07-22 22:26:44,554 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-07-22 22:26:44,554 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-07-22 22:26:44,554 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-22 22:26:44,554 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-22 22:26:44,554 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-22 22:26:44,554 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-22 22:26:44,554 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-22 22:26:44,554 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-22 22:26:44,555 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (< 0 |#StackHeapBarrier|))) (let ((.cse1 (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse0) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse0)))) (or (not .cse0) (and (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse1) (and (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) .cse1 (exists ((|v___CPROVER_overflow_mult_~#c~1.base_81| Int) (v_ArrVal_3301 Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81| v_ArrVal_3301) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81|) 0))))))) [2022-07-22 22:26:44,555 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-22 22:26:44,555 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-07-22 22:26:44,555 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-22 22:26:44,555 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|))) [2022-07-22 22:26:44,555 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-22 22:26:44,556 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-22 22:26:44,556 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-22 22:26:44,556 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-22 22:26:44,556 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-22 22:26:44,556 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-22 22:26:44,556 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-22 22:26:44,556 INFO L902 garLoopResultBuilder]: At program point L10176(line 10176) the Hoare annotation is: true [2022-07-22 22:26:44,557 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-22 22:26:44,557 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) (or (and .cse0 (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) (< 1 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) .cse1 .cse2 .cse3) (and .cse0 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 0) .cse2 .cse3))) [2022-07-22 22:26:44,557 INFO L899 garLoopResultBuilder]: For program point L10135-2(line 10135) no Hoare annotation was computed. [2022-07-22 22:26:44,557 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-22 22:26:44,557 INFO L899 garLoopResultBuilder]: For program point L10164(line 10164) no Hoare annotation was computed. [2022-07-22 22:26:44,557 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-07-22 22:26:44,557 INFO L895 garLoopResultBuilder]: At program point L10164-2(line 10164) the Hoare annotation is: false [2022-07-22 22:26:44,558 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: false [2022-07-22 22:26:44,558 INFO L895 garLoopResultBuilder]: At program point L10135-1(line 10135) the Hoare annotation is: false [2022-07-22 22:26:44,558 INFO L895 garLoopResultBuilder]: At program point L10156-1(lines 10156 10157) the Hoare annotation is: false [2022-07-22 22:26:44,558 INFO L899 garLoopResultBuilder]: For program point L10164-3(line 10164) no Hoare annotation was computed. [2022-07-22 22:26:44,558 INFO L899 garLoopResultBuilder]: For program point L10160(lines 10160 10174) no Hoare annotation was computed. [2022-07-22 22:26:44,558 INFO L899 garLoopResultBuilder]: For program point L10160-1(lines 10160 10174) no Hoare annotation was computed. [2022-07-22 22:26:44,558 INFO L895 garLoopResultBuilder]: At program point L10173(line 10173) the Hoare annotation is: false [2022-07-22 22:26:44,558 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-22 22:26:44,559 INFO L899 garLoopResultBuilder]: For program point L10173-1(line 10173) no Hoare annotation was computed. [2022-07-22 22:26:44,559 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,559 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|))) (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select .cse0 0) |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1|) (= (+ 29629528 (select .cse0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) [2022-07-22 22:26:44,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,559 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-22 22:26:44,559 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-22 22:26:44,560 INFO L899 garLoopResultBuilder]: For program point L10132(lines 10132 10175) no Hoare annotation was computed. [2022-07-22 22:26:44,560 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-22 22:26:44,560 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-07-22 22:26:44,560 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-07-22 22:26:44,560 INFO L899 garLoopResultBuilder]: For program point L10161(lines 10161 10167) no Hoare annotation was computed. [2022-07-22 22:26:44,560 INFO L899 garLoopResultBuilder]: For program point L10161-2(lines 10160 10172) no Hoare annotation was computed. [2022-07-22 22:26:44,560 INFO L895 garLoopResultBuilder]: At program point L10141(line 10141) the Hoare annotation is: false [2022-07-22 22:26:44,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:26:44,561 INFO L899 garLoopResultBuilder]: For program point L10141-1(line 10141) no Hoare annotation was computed. [2022-07-22 22:26:44,561 INFO L895 garLoopResultBuilder]: At program point L10170(line 10170) the Hoare annotation is: false [2022-07-22 22:26:44,561 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-22 22:26:44,561 INFO L895 garLoopResultBuilder]: At program point L10162(line 10162) the Hoare annotation is: false [2022-07-22 22:26:44,561 INFO L895 garLoopResultBuilder]: At program point L10170-1(line 10170) the Hoare annotation is: false [2022-07-22 22:26:44,561 INFO L899 garLoopResultBuilder]: For program point L10170-2(line 10170) no Hoare annotation was computed. [2022-07-22 22:26:44,561 INFO L899 garLoopResultBuilder]: For program point L10154(lines 10154 10155) no Hoare annotation was computed. [2022-07-22 22:26:44,562 INFO L899 garLoopResultBuilder]: For program point L10162-1(line 10162) no Hoare annotation was computed. [2022-07-22 22:26:44,562 INFO L899 garLoopResultBuilder]: For program point L10154-2(lines 10154 10158) no Hoare annotation was computed. [2022-07-22 22:26:44,562 INFO L899 garLoopResultBuilder]: For program point L10154-3(lines 10154 10158) no Hoare annotation was computed. [2022-07-22 22:26:44,562 INFO L895 garLoopResultBuilder]: At program point L10138(line 10138) the Hoare annotation is: false [2022-07-22 22:26:44,562 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-22 22:26:44,562 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-07-22 22:26:44,562 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-22 22:26:44,563 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-07-22 22:26:44,563 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-22 22:26:44,563 INFO L899 garLoopResultBuilder]: For program point L10138-1(line 10138) no Hoare annotation was computed. [2022-07-22 22:26:44,563 INFO L899 garLoopResultBuilder]: For program point L10159-2(line 10159) no Hoare annotation was computed. [2022-07-22 22:26:44,563 INFO L895 garLoopResultBuilder]: At program point L10159(line 10159) the Hoare annotation is: false [2022-07-22 22:26:44,563 INFO L895 garLoopResultBuilder]: At program point L10159-1(line 10159) the Hoare annotation is: false [2022-07-22 22:26:44,563 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:26:44,564 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:26:44,564 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:26:44,564 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:26:44,564 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:26:44,564 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:26:44,567 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:26:44,569 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:26:44,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,580 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:44,580 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,580 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,583 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:44,583 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,583 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:44,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:44,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:44,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:44,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:44,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:26:44 BoogieIcfgContainer [2022-07-22 22:26:44,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:26:44,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:26:44,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:26:44,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:26:44,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:23:41" (3/4) ... [2022-07-22 22:26:44,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:26:44,599 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure uninterpreted_equals [2022-07-22 22:26:44,599 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:26:44,599 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_equals [2022-07-22 22:26:44,599 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_hasher [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_calloc [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_update_template_size [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_keys_eq [2022-07-22 22:26:44,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_for [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_create [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_safe_eq_check [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_alloc_state [2022-07-22 22:26:44,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_emplace_item [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_find_entry [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-22 22:26:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-22 22:26:44,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:26:44,619 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 256 nodes and edges [2022-07-22 22:26:44,621 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2022-07-22 22:26:44,623 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2022-07-22 22:26:44,625 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-07-22 22:26:44,626 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-22 22:26:44,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:26:44,629 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 22:26:44,631 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:26:44,657 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || (((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && tl_last_error == \old(tl_last_error)) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) && \result == 0) [2022-07-22 22:26:44,659 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || (\result + 1 <= 0 && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown)))) || ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown))) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) [2022-07-22 22:26:45,281 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:26:45,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:26:45,282 INFO L158 Benchmark]: Toolchain (without parser) took 188234.09ms. Allocated memory was 92.3MB in the beginning and 453.0MB in the end (delta: 360.7MB). Free memory was 52.4MB in the beginning and 279.8MB in the end (delta: -227.5MB). Peak memory consumption was 328.7MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,282 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 41.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:26:45,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2387.42ms. Allocated memory was 92.3MB in the beginning and 176.2MB in the end (delta: 83.9MB). Free memory was 52.2MB in the beginning and 89.4MB in the end (delta: -37.3MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 195.48ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 74.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,283 INFO L158 Benchmark]: Boogie Preprocessor took 146.60ms. Allocated memory is still 176.2MB. Free memory was 74.8MB in the beginning and 110.8MB in the end (delta: -36.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,283 INFO L158 Benchmark]: RCFGBuilder took 1741.92ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 110.8MB in the beginning and 110.8MB in the end (delta: -59.3kB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,284 INFO L158 Benchmark]: TraceAbstraction took 183064.67ms. Allocated memory was 230.7MB in the beginning and 453.0MB in the end (delta: 222.3MB). Free memory was 110.8MB in the beginning and 143.0MB in the end (delta: -32.2MB). Peak memory consumption was 234.2MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,284 INFO L158 Benchmark]: Witness Printer took 690.71ms. Allocated memory is still 453.0MB. Free memory was 143.0MB in the beginning and 279.8MB in the end (delta: -136.8MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2022-07-22 22:26:45,285 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 41.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2387.42ms. Allocated memory was 92.3MB in the beginning and 176.2MB in the end (delta: 83.9MB). Free memory was 52.2MB in the beginning and 89.4MB in the end (delta: -37.3MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 195.48ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 74.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.60ms. Allocated memory is still 176.2MB. Free memory was 74.8MB in the beginning and 110.8MB in the end (delta: -36.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1741.92ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 110.8MB in the beginning and 110.8MB in the end (delta: -59.3kB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * TraceAbstraction took 183064.67ms. Allocated memory was 230.7MB in the beginning and 453.0MB in the end (delta: 222.3MB). Free memory was 110.8MB in the beginning and 143.0MB in the end (delta: -32.2MB). Peak memory consumption was 234.2MB. Max. memory is 16.1GB. * Witness Printer took 690.71ms. Allocated memory is still 453.0MB. Free memory was 143.0MB in the beginning and 279.8MB in the end (delta: -136.8MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 349 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 183.0s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6482 SdHoareTripleChecker+Valid, 34.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5779 mSDsluCounter, 39605 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3354 IncrementalHoareTripleChecker+Unchecked, 31338 mSDsCounter, 3348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27015 IncrementalHoareTripleChecker+Invalid, 33717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3348 mSolverCounterUnsat, 8267 mSDtfsCounter, 27015 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2204 SyntacticMatches, 9 SemanticMatches, 296 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=19, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 1777 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3531 PreInvPairs, 3569 NumberOfFragments, 914 HoareAnnotationTreeSize, 3531 FomulaSimplifications, 91488 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 134 FomulaSimplificationsInter, 2116 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 118.8s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 3877 NumberOfCodeBlocks, 3877 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3907 ConstructedInterpolants, 52 QuantifiedInterpolants, 8244 SizeOfPredicates, 74 NumberOfNonLiveVariables, 21508 ConjunctsInSsa, 546 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 4500/4558 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9448]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9502]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2022-07-22 22:26:45,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:45,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:45,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:45,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] Derived loop invariant: (((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || (((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && tl_last_error == \old(tl_last_error)) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) && \result == 0) - InvariantResult [Line: 2541]: Loop Invariant [2022-07-22 22:26:45,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:45,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:45,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:45,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-22 22:26:45,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || (\result + 1 <= 0 && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown)))) || ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown))) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9437]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-22 22:26:45,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE