./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 23:58:06,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 23:58:06,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 23:58:06,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 23:58:06,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 23:58:06,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 23:58:06,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 23:58:06,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 23:58:06,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 23:58:06,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 23:58:06,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 23:58:06,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 23:58:06,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 23:58:06,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 23:58:06,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 23:58:06,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 23:58:06,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 23:58:06,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 23:58:06,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 23:58:06,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 23:58:06,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 23:58:06,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 23:58:06,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 23:58:06,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 23:58:06,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 23:58:06,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 23:58:06,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 23:58:06,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 23:58:06,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 23:58:06,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 23:58:06,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 23:58:06,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 23:58:06,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 23:58:06,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 23:58:06,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 23:58:06,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 23:58:06,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 23:58:06,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 23:58:06,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 23:58:06,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 23:58:06,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 23:58:06,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-17 23:58:07,017 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 23:58:07,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 23:58:07,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 23:58:07,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 23:58:07,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 23:58:07,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 23:58:07,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 23:58:07,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 23:58:07,021 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 23:58:07,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 23:58:07,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 23:58:07,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 23:58:07,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 23:58:07,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 23:58:07,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 23:58:07,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 23:58:07,023 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 23:58:07,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 23:58:07,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 23:58:07,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 23:58:07,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 23:58:07,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:58:07,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 23:58:07,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 23:58:07,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 23:58:07,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 23:58:07,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 23:58:07,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 23:58:07,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 23:58:07,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 23:58:07,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 23:58:07,026 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2021-12-17 23:58:07,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 23:58:07,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 23:58:07,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 23:58:07,210 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 23:58:07,211 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 23:58:07,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-17 23:58:07,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae68e0ca0/395234fd1b7e4089801f99e39eaaef63/FLAG5c09c10d5 [2021-12-17 23:58:07,788 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 23:58:07,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-17 23:58:07,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae68e0ca0/395234fd1b7e4089801f99e39eaaef63/FLAG5c09c10d5 [2021-12-17 23:58:07,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae68e0ca0/395234fd1b7e4089801f99e39eaaef63 [2021-12-17 23:58:08,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 23:58:08,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 23:58:08,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 23:58:08,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 23:58:08,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 23:58:08,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:58:07" (1/1) ... [2021-12-17 23:58:08,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dec023e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:08, skipping insertion in model container [2021-12-17 23:58:08,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:58:07" (1/1) ... [2021-12-17 23:58:08,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 23:58:08,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 23:58:08,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-12-17 23:58:08,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-12-17 23:58:08,717 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,717 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,718 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,718 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,719 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,733 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,735 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,737 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,737 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:08,950 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-17 23:58:08,951 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-17 23:58:08,952 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-17 23:58:08,955 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-17 23:58:08,959 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-17 23:58:08,962 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-17 23:58:08,962 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-17 23:58:08,963 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-17 23:58:08,965 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-17 23:58:08,967 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-17 23:58:09,089 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-17 23:58:09,167 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,168 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:58:09,268 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 23:58:09,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-12-17 23:58:09,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-12-17 23:58:09,317 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,318 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,320 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,325 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,326 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,326 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,327 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,352 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-17 23:58:09,353 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-17 23:58:09,353 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-17 23:58:09,354 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-17 23:58:09,354 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-17 23:58:09,354 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-17 23:58:09,355 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-17 23:58:09,355 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-17 23:58:09,356 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-17 23:58:09,356 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-17 23:58:09,374 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-17 23:58:09,410 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,411 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:58:09,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:58:09,566 INFO L208 MainTranslator]: Completed translation [2021-12-17 23:58:09,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09 WrapperNode [2021-12-17 23:58:09,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 23:58:09,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 23:58:09,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 23:58:09,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 23:58:09,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,711 INFO L137 Inliner]: procedures = 690, calls = 2496, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 779 [2021-12-17 23:58:09,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 23:58:09,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 23:58:09,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 23:58:09,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 23:58:09,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 23:58:09,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 23:58:09,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 23:58:09,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 23:58:09,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (1/1) ... [2021-12-17 23:58:09,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:58:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:58:09,817 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) [2021-12-17 23:58:09,842 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 [2021-12-17 23:58:09,849 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-17 23:58:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-17 23:58:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 23:58:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-17 23:58:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-17 23:58:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2021-12-17 23:58:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2021-12-17 23:58:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 23:58:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-12-17 23:58:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-12-17 23:58:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 23:58:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 23:58:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 23:58:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 23:58:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 23:58:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 23:58:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 23:58:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-17 23:58:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-17 23:58:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-12-17 23:58:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-12-17 23:58:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 23:58:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 23:58:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2021-12-17 23:58:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2021-12-17 23:58:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 23:58:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 23:58:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 23:58:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-17 23:58:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-17 23:58:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 23:58:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 23:58:10,070 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 23:58:10,079 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 23:58:10,504 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 23:58:10,511 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 23:58:10,511 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 23:58:10,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:58:10 BoogieIcfgContainer [2021-12-17 23:58:10,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 23:58:10,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 23:58:10,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 23:58:10,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 23:58:10,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:58:07" (1/3) ... [2021-12-17 23:58:10,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cbfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:58:10, skipping insertion in model container [2021-12-17 23:58:10,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:09" (2/3) ... [2021-12-17 23:58:10,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cbfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:58:10, skipping insertion in model container [2021-12-17 23:58:10,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:58:10" (3/3) ... [2021-12-17 23:58:10,520 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-12-17 23:58:10,523 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 23:58:10,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 23:58:10,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 23:58:10,554 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 23:58:10,554 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 23:58:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-17 23:58:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 23:58:10,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:10,573 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:10,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2021-12-17 23:58:10,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:10,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329562459] [2021-12-17 23:58:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:10,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:10,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:10,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329562459] [2021-12-17 23:58:10,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329562459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:10,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:10,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 23:58:10,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930775680] [2021-12-17 23:58:10,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:10,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 23:58:10,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 23:58:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 23:58:10,993 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:11,016 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2021-12-17 23:58:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 23:58:11,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-17 23:58:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:11,024 INFO L225 Difference]: With dead ends: 193 [2021-12-17 23:58:11,025 INFO L226 Difference]: Without dead ends: 93 [2021-12-17 23:58:11,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 23:58:11,033 INFO L933 BasicCegarLoop]: 121 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, 121 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 [2021-12-17 23:58:11,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-17 23:58:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-17 23:58:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:58:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-12-17 23:58:11,069 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2021-12-17 23:58:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:11,070 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-12-17 23:58:11,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-12-17 23:58:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 23:58:11,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:11,073 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:11,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 23:58:11,073 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2021-12-17 23:58:11,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62915760] [2021-12-17 23:58:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:11,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:11,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62915760] [2021-12-17 23:58:11,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62915760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:11,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:11,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:58:11,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423044166] [2021-12-17 23:58:11,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:11,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:58:11,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:58:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:58:11,231 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:11,270 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2021-12-17 23:58:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:58:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-17 23:58:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:11,272 INFO L225 Difference]: With dead ends: 147 [2021-12-17 23:58:11,272 INFO L226 Difference]: Without dead ends: 110 [2021-12-17 23:58:11,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:58:11,273 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:11,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-17 23:58:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2021-12-17 23:58:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:58:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-12-17 23:58:11,282 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2021-12-17 23:58:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:11,282 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-12-17 23:58:11,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-12-17 23:58:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 23:58:11,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:11,285 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:11,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 23:58:11,285 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:11,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2021-12-17 23:58:11,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:11,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757200439] [2021-12-17 23:58:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:11,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:11,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:11,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757200439] [2021-12-17 23:58:11,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757200439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:11,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:11,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 23:58:11,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682289612] [2021-12-17 23:58:11,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:11,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:58:11,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:11,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:58:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:58:11,499 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:11,553 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2021-12-17 23:58:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:58:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-17 23:58:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:11,555 INFO L225 Difference]: With dead ends: 134 [2021-12-17 23:58:11,555 INFO L226 Difference]: Without dead ends: 96 [2021-12-17 23:58:11,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:58:11,556 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:11,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-17 23:58:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-17 23:58:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:58:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2021-12-17 23:58:11,565 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2021-12-17 23:58:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:11,566 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2021-12-17 23:58:11,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2021-12-17 23:58:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 23:58:11,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:11,569 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:11,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 23:58:11,570 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2021-12-17 23:58:11,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:11,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662801739] [2021-12-17 23:58:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:11,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:11,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662801739] [2021-12-17 23:58:11,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662801739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:11,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:11,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:58:11,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937082497] [2021-12-17 23:58:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:11,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:58:11,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:58:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:58:11,688 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:11,724 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2021-12-17 23:58:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:58:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-17 23:58:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:11,727 INFO L225 Difference]: With dead ends: 141 [2021-12-17 23:58:11,727 INFO L226 Difference]: Without dead ends: 106 [2021-12-17 23:58:11,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:58:11,731 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:11,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-17 23:58:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2021-12-17 23:58:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:58:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-12-17 23:58:11,749 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2021-12-17 23:58:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:11,750 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-12-17 23:58:11,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-12-17 23:58:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 23:58:11,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:11,751 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:11,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 23:58:11,751 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2021-12-17 23:58:11,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743173456] [2021-12-17 23:58:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:11,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:11,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743173456] [2021-12-17 23:58:11,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743173456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:11,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:11,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:58:11,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431038287] [2021-12-17 23:58:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:11,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:58:11,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:11,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:58:11,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:11,939 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:11,985 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2021-12-17 23:58:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:58:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-17 23:58:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:11,988 INFO L225 Difference]: With dead ends: 110 [2021-12-17 23:58:11,988 INFO L226 Difference]: Without dead ends: 108 [2021-12-17 23:58:11,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:11,991 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:11,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 733 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-17 23:58:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-12-17 23:58:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-12-17 23:58:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-12-17 23:58:12,006 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2021-12-17 23:58:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:12,007 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-12-17 23:58:12,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-12-17 23:58:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 23:58:12,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:12,011 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:12,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 23:58:12,011 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:12,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2021-12-17 23:58:12,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:12,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545512167] [2021-12-17 23:58:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:12,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:12,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:12,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545512167] [2021-12-17 23:58:12,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545512167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:12,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:12,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 23:58:12,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943636322] [2021-12-17 23:58:12,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:12,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:58:12,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:58:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:58:12,239 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:12,363 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2021-12-17 23:58:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:58:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-17 23:58:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:12,364 INFO L225 Difference]: With dead ends: 185 [2021-12-17 23:58:12,364 INFO L226 Difference]: Without dead ends: 144 [2021-12-17 23:58:12,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:12,365 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 71 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:12,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 388 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-17 23:58:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2021-12-17 23:58:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.175) internal successors, (94), 82 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-12-17 23:58:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2021-12-17 23:58:12,370 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 41 [2021-12-17 23:58:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:12,370 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2021-12-17 23:58:12,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2021-12-17 23:58:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 23:58:12,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:12,371 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:12,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 23:58:12,372 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1320987672, now seen corresponding path program 1 times [2021-12-17 23:58:12,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:12,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296149154] [2021-12-17 23:58:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:12,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:12,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:12,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296149154] [2021-12-17 23:58:12,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296149154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:12,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:12,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:58:12,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482939502] [2021-12-17 23:58:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:12,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:58:12,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:12,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:58:12,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:12,591 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:12,714 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2021-12-17 23:58:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:58:12,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-17 23:58:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:12,716 INFO L225 Difference]: With dead ends: 191 [2021-12-17 23:58:12,716 INFO L226 Difference]: Without dead ends: 143 [2021-12-17 23:58:12,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-17 23:58:12,718 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 85 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:12,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 393 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-17 23:58:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2021-12-17 23:58:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 92 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-17 23:58:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2021-12-17 23:58:12,723 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 41 [2021-12-17 23:58:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:12,725 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2021-12-17 23:58:12,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2021-12-17 23:58:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 23:58:12,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:12,726 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:12,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 23:58:12,727 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2021-12-17 23:58:12,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:12,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614012956] [2021-12-17 23:58:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:12,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:13,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614012956] [2021-12-17 23:58:13,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614012956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:13,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:13,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:58:13,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173057899] [2021-12-17 23:58:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:13,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:58:13,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:58:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:13,081 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 23:58:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:13,351 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2021-12-17 23:58:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 23:58:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2021-12-17 23:58:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:13,353 INFO L225 Difference]: With dead ends: 207 [2021-12-17 23:58:13,353 INFO L226 Difference]: Without dead ends: 149 [2021-12-17 23:58:13,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:58:13,354 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:13,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 560 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:58:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-17 23:58:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 136. [2021-12-17 23:58:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 104 states have internal predecessors, (118), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-17 23:58:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2021-12-17 23:58:13,364 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 41 [2021-12-17 23:58:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:13,364 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2021-12-17 23:58:13,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 23:58:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2021-12-17 23:58:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 23:58:13,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:13,365 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:13,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 23:58:13,366 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -525525668, now seen corresponding path program 1 times [2021-12-17 23:58:13,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:13,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177645166] [2021-12-17 23:58:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:13,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:13,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177645166] [2021-12-17 23:58:13,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177645166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:13,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:13,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:58:13,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828258023] [2021-12-17 23:58:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:13,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:58:13,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:58:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:13,636 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:13,870 INFO L93 Difference]: Finished difference Result 238 states and 301 transitions. [2021-12-17 23:58:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:58:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-17 23:58:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:13,872 INFO L225 Difference]: With dead ends: 238 [2021-12-17 23:58:13,872 INFO L226 Difference]: Without dead ends: 170 [2021-12-17 23:58:13,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-12-17 23:58:13,873 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 39 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:13,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 555 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-17 23:58:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2021-12-17 23:58:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-17 23:58:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2021-12-17 23:58:13,878 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 41 [2021-12-17 23:58:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:13,879 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2021-12-17 23:58:13,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2021-12-17 23:58:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 23:58:13,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:13,880 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:13,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 23:58:13,880 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2021-12-17 23:58:13,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:13,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006265803] [2021-12-17 23:58:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:13,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:14,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:14,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006265803] [2021-12-17 23:58:14,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006265803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:14,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:14,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 23:58:14,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999469649] [2021-12-17 23:58:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:14,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 23:58:14,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 23:58:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:58:14,005 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:14,088 INFO L93 Difference]: Finished difference Result 226 states and 285 transitions. [2021-12-17 23:58:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:58:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-17 23:58:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:14,089 INFO L225 Difference]: With dead ends: 226 [2021-12-17 23:58:14,089 INFO L226 Difference]: Without dead ends: 154 [2021-12-17 23:58:14,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:58:14,090 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:14,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 339 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-17 23:58:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2021-12-17 23:58:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 106 states have internal predecessors, (119), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-17 23:58:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2021-12-17 23:58:14,095 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 41 [2021-12-17 23:58:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:14,096 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2021-12-17 23:58:14,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2021-12-17 23:58:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 23:58:14,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:14,096 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:14,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 23:58:14,097 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2021-12-17 23:58:14,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:14,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289316542] [2021-12-17 23:58:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:14,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:14,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289316542] [2021-12-17 23:58:14,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289316542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:14,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:14,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:58:14,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744016520] [2021-12-17 23:58:14,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:14,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:58:14,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:14,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:58:14,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:14,273 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:14,362 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2021-12-17 23:58:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:58:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-17 23:58:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:14,364 INFO L225 Difference]: With dead ends: 164 [2021-12-17 23:58:14,364 INFO L226 Difference]: Without dead ends: 162 [2021-12-17 23:58:14,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:58:14,365 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:14,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 934 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-17 23:58:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-12-17 23:58:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 114 states have internal predecessors, (126), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2021-12-17 23:58:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2021-12-17 23:58:14,370 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 43 [2021-12-17 23:58:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:14,371 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2021-12-17 23:58:14,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 23:58:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2021-12-17 23:58:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 23:58:14,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:14,372 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:14,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 23:58:14,372 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2021-12-17 23:58:14,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298131170] [2021-12-17 23:58:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:14,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:14,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298131170] [2021-12-17 23:58:14,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298131170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:14,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:14,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:58:14,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705684723] [2021-12-17 23:58:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:14,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:58:14,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:58:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:58:14,600 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:14,771 INFO L93 Difference]: Finished difference Result 250 states and 307 transitions. [2021-12-17 23:58:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:58:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-17 23:58:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:14,772 INFO L225 Difference]: With dead ends: 250 [2021-12-17 23:58:14,772 INFO L226 Difference]: Without dead ends: 172 [2021-12-17 23:58:14,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-17 23:58:14,773 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:14,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 459 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-17 23:58:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2021-12-17 23:58:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 107 states have internal predecessors, (120), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2021-12-17 23:58:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2021-12-17 23:58:14,780 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 43 [2021-12-17 23:58:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:14,781 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2021-12-17 23:58:14,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 23:58:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2021-12-17 23:58:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 23:58:14,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:14,782 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:58:14,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 23:58:14,782 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2021-12-17 23:58:14,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:14,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308791116] [2021-12-17 23:58:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:14,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-17 23:58:14,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:14,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308791116] [2021-12-17 23:58:14,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308791116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:14,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:14,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:58:14,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144024878] [2021-12-17 23:58:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:14,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:58:14,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:58:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:14,977 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 23:58:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:15,023 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2021-12-17 23:58:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:58:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-12-17 23:58:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:15,025 INFO L225 Difference]: With dead ends: 151 [2021-12-17 23:58:15,025 INFO L226 Difference]: Without dead ends: 149 [2021-12-17 23:58:15,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:15,026 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:15,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 748 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-17 23:58:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-12-17 23:58:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 114 states have internal predecessors, (126), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-17 23:58:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-12-17 23:58:15,032 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 57 [2021-12-17 23:58:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:15,032 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-12-17 23:58:15,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 23:58:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-12-17 23:58:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-17 23:58:15,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:15,033 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:15,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 23:58:15,034 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1061292592, now seen corresponding path program 1 times [2021-12-17 23:58:15,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277465503] [2021-12-17 23:58:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:15,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 23:58:15,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277465503] [2021-12-17 23:58:15,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277465503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:15,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:15,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:58:15,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898820576] [2021-12-17 23:58:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:15,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:58:15,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:58:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:15,271 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:15,442 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2021-12-17 23:58:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:58:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-17 23:58:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:15,444 INFO L225 Difference]: With dead ends: 189 [2021-12-17 23:58:15,445 INFO L226 Difference]: Without dead ends: 176 [2021-12-17 23:58:15,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:58:15,446 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 77 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:15,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 620 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-17 23:58:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2021-12-17 23:58:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.1565217391304348) internal successors, (133), 123 states have internal predecessors, (133), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-17 23:58:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2021-12-17 23:58:15,453 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 61 [2021-12-17 23:58:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:15,454 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2021-12-17 23:58:15,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2021-12-17 23:58:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-17 23:58:15,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:15,455 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:15,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 23:58:15,455 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2021-12-17 23:58:15,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:15,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053051457] [2021-12-17 23:58:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:15,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 23:58:15,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053051457] [2021-12-17 23:58:15,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053051457] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:58:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60586] [2021-12-17 23:58:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:15,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:58:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:58:15,821 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) [2021-12-17 23:58:15,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 23:58:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:16,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 23:58:16,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:58:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:58:16,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:58:17,247 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-17 23:58:17,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-17 23:58:17,253 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-17 23:58:17,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-17 23:58:17,390 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-17 23:58:17,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-17 23:58:17,399 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-17 23:58:17,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-17 23:58:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 23:58:17,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60586] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:58:17,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:58:17,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 30 [2021-12-17 23:58:17,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792375614] [2021-12-17 23:58:17,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:58:17,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-17 23:58:17,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-17 23:58:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2021-12-17 23:58:17,473 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-17 23:58:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:18,761 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2021-12-17 23:58:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 23:58:18,762 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 61 [2021-12-17 23:58:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:18,763 INFO L225 Difference]: With dead ends: 242 [2021-12-17 23:58:18,763 INFO L226 Difference]: Without dead ends: 203 [2021-12-17 23:58:18,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=2109, Unknown=0, NotChecked=0, Total=2550 [2021-12-17 23:58:18,764 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 229 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:18,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 1935 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 537 Invalid, 0 Unknown, 186 Unchecked, 0.4s Time] [2021-12-17 23:58:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-17 23:58:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2021-12-17 23:58:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.144927536231884) internal successors, (158), 147 states have internal predecessors, (158), 26 states have call successors, (26), 14 states have call predecessors, (26), 20 states have return successors, (42), 23 states have call predecessors, (42), 25 states have call successors, (42) [2021-12-17 23:58:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2021-12-17 23:58:18,770 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 61 [2021-12-17 23:58:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:18,771 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2021-12-17 23:58:18,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-17 23:58:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2021-12-17 23:58:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-17 23:58:18,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:18,772 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:18,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 23:58:18,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 23:58:18,991 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash -785220748, now seen corresponding path program 1 times [2021-12-17 23:58:18,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:18,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039015873] [2021-12-17 23:58:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:18,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 23:58:19,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:19,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039015873] [2021-12-17 23:58:19,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039015873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:19,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:19,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 23:58:19,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720796440] [2021-12-17 23:58:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:19,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 23:58:19,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 23:58:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:58:19,294 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:19,528 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2021-12-17 23:58:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 23:58:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-17 23:58:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:19,530 INFO L225 Difference]: With dead ends: 225 [2021-12-17 23:58:19,530 INFO L226 Difference]: Without dead ends: 212 [2021-12-17 23:58:19,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-12-17 23:58:19,530 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:19,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 610 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-17 23:58:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2021-12-17 23:58:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.144927536231884) internal successors, (158), 147 states have internal predecessors, (158), 26 states have call successors, (26), 14 states have call predecessors, (26), 20 states have return successors, (42), 23 states have call predecessors, (42), 25 states have call successors, (42) [2021-12-17 23:58:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2021-12-17 23:58:19,540 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 61 [2021-12-17 23:58:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:19,540 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2021-12-17 23:58:19,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2021-12-17 23:58:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 23:58:19,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:19,544 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:58:19,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 23:58:19,544 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2021-12-17 23:58:19,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:19,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500728375] [2021-12-17 23:58:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:19,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 23:58:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-17 23:58:19,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500728375] [2021-12-17 23:58:19,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500728375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:19,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:19,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 23:58:19,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100628714] [2021-12-17 23:58:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:19,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 23:58:19,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 23:58:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 23:58:19,792 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-17 23:58:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:19,940 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2021-12-17 23:58:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:58:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2021-12-17 23:58:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:19,941 INFO L225 Difference]: With dead ends: 199 [2021-12-17 23:58:19,941 INFO L226 Difference]: Without dead ends: 197 [2021-12-17 23:58:19,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:58:19,942 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 43 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:19,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 589 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-17 23:58:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2021-12-17 23:58:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.1408450704225352) internal successors, (162), 151 states have internal predecessors, (162), 29 states have call successors, (29), 15 states have call predecessors, (29), 21 states have return successors, (45), 26 states have call predecessors, (45), 28 states have call successors, (45) [2021-12-17 23:58:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2021-12-17 23:58:19,950 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 63 [2021-12-17 23:58:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:19,950 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2021-12-17 23:58:19,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-17 23:58:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2021-12-17 23:58:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 23:58:19,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:19,951 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:19,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 23:58:19,951 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2021-12-17 23:58:19,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924307506] [2021-12-17 23:58:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:19,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-17 23:58:20,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:20,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924307506] [2021-12-17 23:58:20,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924307506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:20,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:20,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:58:20,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082739310] [2021-12-17 23:58:20,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:20,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:58:20,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:58:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:20,102 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 23:58:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:20,174 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2021-12-17 23:58:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:58:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-12-17 23:58:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:20,175 INFO L225 Difference]: With dead ends: 209 [2021-12-17 23:58:20,175 INFO L226 Difference]: Without dead ends: 207 [2021-12-17 23:58:20,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:58:20,176 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:20,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 955 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:58:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-17 23:58:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2021-12-17 23:58:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 29 states have call successors, (29), 15 states have call predecessors, (29), 22 states have return successors, (46), 26 states have call predecessors, (46), 28 states have call successors, (46) [2021-12-17 23:58:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2021-12-17 23:58:20,183 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 63 [2021-12-17 23:58:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:20,183 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2021-12-17 23:58:20,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-17 23:58:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2021-12-17 23:58:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 23:58:20,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:20,184 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:20,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 23:58:20,184 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2021-12-17 23:58:20,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:20,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393168158] [2021-12-17 23:58:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:20,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 23:58:20,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393168158] [2021-12-17 23:58:20,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393168158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:20,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:20,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:58:20,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592148143] [2021-12-17 23:58:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:20,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:58:20,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:58:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:20,342 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:20,454 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2021-12-17 23:58:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:58:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2021-12-17 23:58:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:20,455 INFO L225 Difference]: With dead ends: 225 [2021-12-17 23:58:20,455 INFO L226 Difference]: Without dead ends: 208 [2021-12-17 23:58:20,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 23:58:20,456 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 43 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:20,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 464 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-17 23:58:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 187. [2021-12-17 23:58:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.145985401459854) internal successors, (157), 145 states have internal predecessors, (157), 29 states have call successors, (29), 15 states have call predecessors, (29), 20 states have return successors, (41), 26 states have call predecessors, (41), 28 states have call successors, (41) [2021-12-17 23:58:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2021-12-17 23:58:20,463 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 63 [2021-12-17 23:58:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:20,463 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2021-12-17 23:58:20,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2021-12-17 23:58:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 23:58:20,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:20,465 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-12-17 23:58:20,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 23:58:20,465 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:20,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2021-12-17 23:58:20,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:20,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577538033] [2021-12-17 23:58:20,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:20,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 23:58:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 23:58:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 23:58:20,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:20,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577538033] [2021-12-17 23:58:20,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577538033] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:20,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:20,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:58:20,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034147031] [2021-12-17 23:58:20,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:20,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:58:20,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:58:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:20,631 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 23:58:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:20,745 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2021-12-17 23:58:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:58:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2021-12-17 23:58:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:20,746 INFO L225 Difference]: With dead ends: 197 [2021-12-17 23:58:20,746 INFO L226 Difference]: Without dead ends: 195 [2021-12-17 23:58:20,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:58:20,747 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:20,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 687 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-17 23:58:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2021-12-17 23:58:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 149 states have internal predecessors, (161), 30 states have call successors, (30), 16 states have call predecessors, (30), 21 states have return successors, (42), 27 states have call predecessors, (42), 29 states have call successors, (42) [2021-12-17 23:58:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2021-12-17 23:58:20,753 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 69 [2021-12-17 23:58:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:20,753 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2021-12-17 23:58:20,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 23:58:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2021-12-17 23:58:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 23:58:20,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:20,754 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:58:20,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-17 23:58:20,755 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:20,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2021-12-17 23:58:20,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:20,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78675774] [2021-12-17 23:58:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:20,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 23:58:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 23:58:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 23:58:21,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78675774] [2021-12-17 23:58:21,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78675774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:21,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:21,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 23:58:21,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045261471] [2021-12-17 23:58:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:21,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 23:58:21,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 23:58:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:58:21,146 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:21,449 INFO L93 Difference]: Finished difference Result 242 states and 293 transitions. [2021-12-17 23:58:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 23:58:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2021-12-17 23:58:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:21,451 INFO L225 Difference]: With dead ends: 242 [2021-12-17 23:58:21,451 INFO L226 Difference]: Without dead ends: 216 [2021-12-17 23:58:21,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:58:21,452 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 77 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:21,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 721 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:58:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-17 23:58:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2021-12-17 23:58:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 152 states have internal predecessors, (164), 32 states have call successors, (32), 16 states have call predecessors, (32), 21 states have return successors, (45), 29 states have call predecessors, (45), 31 states have call successors, (45) [2021-12-17 23:58:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 241 transitions. [2021-12-17 23:58:21,459 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 241 transitions. Word has length 67 [2021-12-17 23:58:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:21,460 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 241 transitions. [2021-12-17 23:58:21,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 23:58:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 241 transitions. [2021-12-17 23:58:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-17 23:58:21,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:21,461 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2021-12-17 23:58:21,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 23:58:21,461 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2021-12-17 23:58:21,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:21,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779831104] [2021-12-17 23:58:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:21,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:58:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 23:58:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 23:58:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 23:58:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-17 23:58:21,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:21,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779831104] [2021-12-17 23:58:21,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779831104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:21,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:21,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 23:58:21,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809415710] [2021-12-17 23:58:21,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:21,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 23:58:21,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 23:58:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:58:21,834 INFO L87 Difference]: Start difference. First operand 198 states and 241 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 23:58:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:22,064 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2021-12-17 23:58:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:58:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2021-12-17 23:58:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:22,065 INFO L225 Difference]: With dead ends: 206 [2021-12-17 23:58:22,065 INFO L226 Difference]: Without dead ends: 154 [2021-12-17 23:58:22,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-12-17 23:58:22,066 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 162 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:22,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 617 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:58:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-17 23:58:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2021-12-17 23:58:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-12-17 23:58:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2021-12-17 23:58:22,071 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 75 [2021-12-17 23:58:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:22,071 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2021-12-17 23:58:22,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 23:58:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2021-12-17 23:58:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-17 23:58:22,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:22,072 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:22,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 23:58:22,072 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2021-12-17 23:58:22,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:22,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225572225] [2021-12-17 23:58:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:22,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 23:58:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 23:58:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 23:58:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 23:58:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 23:58:22,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:22,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225572225] [2021-12-17 23:58:22,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225572225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:22,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:22,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:58:22,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52347354] [2021-12-17 23:58:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:22,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:58:22,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:22,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:58:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:22,261 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-17 23:58:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:22,515 INFO L93 Difference]: Finished difference Result 243 states and 288 transitions. [2021-12-17 23:58:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 23:58:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2021-12-17 23:58:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:22,517 INFO L225 Difference]: With dead ends: 243 [2021-12-17 23:58:22,517 INFO L226 Difference]: Without dead ends: 153 [2021-12-17 23:58:22,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-17 23:58:22,518 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 103 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:22,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 345 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:58:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-17 23:58:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2021-12-17 23:58:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 109 states have internal predecessors, (119), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-17 23:58:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2021-12-17 23:58:22,523 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 79 [2021-12-17 23:58:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:22,523 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2021-12-17 23:58:22,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-17 23:58:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2021-12-17 23:58:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-17 23:58:22,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:22,524 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:22,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-17 23:58:22,524 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2021-12-17 23:58:22,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:22,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392846823] [2021-12-17 23:58:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:22,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 23:58:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 23:58:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 23:58:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 23:58:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 23:58:22,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392846823] [2021-12-17 23:58:22,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392846823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:22,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:22,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 23:58:22,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270935578] [2021-12-17 23:58:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:22,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 23:58:22,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 23:58:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:58:22,735 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 23:58:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:23,141 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2021-12-17 23:58:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 23:58:23,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-17 23:58:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:23,143 INFO L225 Difference]: With dead ends: 244 [2021-12-17 23:58:23,143 INFO L226 Difference]: Without dead ends: 177 [2021-12-17 23:58:23,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-12-17 23:58:23,144 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 169 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:23,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 447 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 23:58:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-17 23:58:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2021-12-17 23:58:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 115 states have internal predecessors, (126), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-17 23:58:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 178 transitions. [2021-12-17 23:58:23,151 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 178 transitions. Word has length 85 [2021-12-17 23:58:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:23,151 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 178 transitions. [2021-12-17 23:58:23,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 23:58:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2021-12-17 23:58:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-17 23:58:23,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:23,152 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:23,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-17 23:58:23,152 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2021-12-17 23:58:23,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:23,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394131339] [2021-12-17 23:58:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:23,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 23:58:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 23:58:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 23:58:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 23:58:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 23:58:23,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394131339] [2021-12-17 23:58:23,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394131339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:23,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:23,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:58:23,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4085136] [2021-12-17 23:58:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:23,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:58:23,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:58:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:58:23,298 INFO L87 Difference]: Start difference. First operand 152 states and 178 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 23:58:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:23,510 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2021-12-17 23:58:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:58:23,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-17 23:58:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:23,511 INFO L225 Difference]: With dead ends: 224 [2021-12-17 23:58:23,511 INFO L226 Difference]: Without dead ends: 156 [2021-12-17 23:58:23,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:23,512 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:23,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:58:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-17 23:58:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2021-12-17 23:58:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.128440366972477) internal successors, (123), 114 states have internal predecessors, (123), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-17 23:58:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2021-12-17 23:58:23,518 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 85 [2021-12-17 23:58:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:23,518 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2021-12-17 23:58:23,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 23:58:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2021-12-17 23:58:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-17 23:58:23,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:23,519 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 23:58:23,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-17 23:58:23,519 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1899820425, now seen corresponding path program 1 times [2021-12-17 23:58:23,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:23,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141147688] [2021-12-17 23:58:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:23,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 23:58:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 23:58:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 23:58:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 23:58:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:58:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 23:58:23,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141147688] [2021-12-17 23:58:23,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141147688] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:23,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:23,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:58:23,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900960226] [2021-12-17 23:58:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:23,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:58:23,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:58:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:58:23,659 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 23:58:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:23,833 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2021-12-17 23:58:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:58:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2021-12-17 23:58:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:23,834 INFO L225 Difference]: With dead ends: 211 [2021-12-17 23:58:23,834 INFO L226 Difference]: Without dead ends: 100 [2021-12-17 23:58:23,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:58:23,835 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:23,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:58:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-17 23:58:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-12-17 23:58:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-12-17 23:58:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-12-17 23:58:23,839 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 87 [2021-12-17 23:58:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:23,839 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-12-17 23:58:23,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 23:58:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-12-17 23:58:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-17 23:58:23,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:23,840 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-17 23:58:23,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-17 23:58:23,840 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:23,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2021-12-17 23:58:23,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:23,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229316905] [2021-12-17 23:58:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:23,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 23:58:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 23:58:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 23:58:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:58:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 23:58:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-17 23:58:24,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:24,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229316905] [2021-12-17 23:58:24,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229316905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:24,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:58:24,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-17 23:58:24,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925885784] [2021-12-17 23:58:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:24,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 23:58:24,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:24,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 23:58:24,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:58:24,437 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-17 23:58:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:24,986 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2021-12-17 23:58:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:58:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2021-12-17 23:58:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:24,987 INFO L225 Difference]: With dead ends: 150 [2021-12-17 23:58:24,987 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 23:58:24,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-12-17 23:58:24,988 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 221 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:24,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 248 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:58:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 23:58:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-17 23:58:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 23:58:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-12-17 23:58:24,992 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2021-12-17 23:58:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:24,992 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-12-17 23:58:24,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-17 23:58:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-12-17 23:58:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-17 23:58:24,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:58:24,993 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-17 23:58:24,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-17 23:58:24,993 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:58:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:58:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2021-12-17 23:58:24,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:58:24,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467787536] [2021-12-17 23:58:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:24,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:58:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:58:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:58:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:58:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 23:58:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 23:58:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 23:58:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 23:58:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:58:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:58:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 23:58:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-17 23:58:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-17 23:58:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-17 23:58:25,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:58:25,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467787536] [2021-12-17 23:58:25,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467787536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:58:25,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551435664] [2021-12-17 23:58:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:58:25,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:58:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:58:25,604 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) [2021-12-17 23:58:25,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 23:58:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:58:25,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-17 23:58:25,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:58:26,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:58:26,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:58:26,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:58:26,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 23:58:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-17 23:58:26,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:58:26,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551435664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:58:26,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:58:26,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2021-12-17 23:58:26,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043109787] [2021-12-17 23:58:26,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:58:26,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 23:58:26,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:58:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 23:58:26,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-12-17 23:58:26,741 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-17 23:58:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:58:26,808 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2021-12-17 23:58:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:58:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 116 [2021-12-17 23:58:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:58:26,809 INFO L225 Difference]: With dead ends: 95 [2021-12-17 23:58:26,809 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 23:58:26,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-12-17 23:58:26,810 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:58:26,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 470 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2021-12-17 23:58:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 23:58:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 23:58:26,810 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) [2021-12-17 23:58:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 23:58:26,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2021-12-17 23:58:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:58:26,811 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 23:58:26,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-17 23:58:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 23:58:26,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 23:58:26,812 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 23:58:26,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 23:58:27,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-17 23:58:27,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 23:58:29,407 INFO L854 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-17 23:58:29,407 INFO L854 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-17 23:58:29,407 INFO L858 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2021-12-17 23:58:29,407 INFO L854 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-17 23:58:29,407 INFO L858 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2021-12-17 23:58:29,407 INFO L858 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2021-12-17 23:58:29,407 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (not (= |~#s_can_fail_allocator_static~0.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L858 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.base 0) (<= 0 aws_mem_acquire_~mem~0.offset) (<= aws_mem_acquire_~mem~0.offset 0) (<= 0 aws_mem_acquire_~mem~0.base)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,408 INFO L854 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,411 INFO L854 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L858 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,419 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-17 23:58:29,420 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-17 23:58:29,420 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L861 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2021-12-17 23:58:29,421 INFO L861 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L854 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16))) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 23:58:29,421 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 23:58:29,422 INFO L854 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (<= .cse16 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse15) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse3 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse4 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse16)) (.cse9 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse15) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse12 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)))) (let ((.cse14 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse14) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse14) 0) .cse10 .cse11 .cse12 .cse13))))) [2021-12-17 23:58:29,422 INFO L861 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-12-17 23:58:29,422 INFO L858 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2021-12-17 23:58:29,422 INFO L854 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (<= .cse18 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse5 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse6 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse18)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse13 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse15 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse3) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse3) 0) .cse12 .cse13 .cse14 .cse15 .cse16)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|))))) [2021-12-17 23:58:29,422 INFO L858 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-12-17 23:58:29,422 INFO L858 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-12-17 23:58:29,425 INFO L854 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1| 0) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) [2021-12-17 23:58:29,426 INFO L858 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2021-12-17 23:58:29,427 INFO L858 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-12-17 23:58:29,427 INFO L858 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-12-17 23:58:29,427 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 23:58:29,427 INFO L854 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616))) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (<= .cse18 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse5 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse8 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse18)) (.cse14 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse15 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse17) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse6 (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0)) (and .cse1 .cse11 .cse12 .cse5 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 .cse6 .cse9 (< .cse0 |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse1 .cse11 .cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse16) 0) .cse5 .cse7 .cse8 .cse10 .cse13 .cse14 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse16) 0) .cse15 .cse2 .cse3 .cse4 .cse6 .cse9))))) [2021-12-17 23:58:29,427 INFO L854 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1|))) [2021-12-17 23:58:29,428 INFO L854 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|)) (= |~#s_can_fail_allocator_static~0.offset| 0) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) [2021-12-17 23:58:29,428 INFO L858 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2021-12-17 23:58:29,428 INFO L854 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) [2021-12-17 23:58:29,428 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) [2021-12-17 23:58:29,428 INFO L858 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2021-12-17 23:58:29,428 INFO L858 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2021-12-17 23:58:29,428 INFO L858 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2021-12-17 23:58:29,428 INFO L854 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (not (= 0 (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616))) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) [2021-12-17 23:58:29,429 INFO L854 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse17 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (<= .cse17 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|)) (.cse3 (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse5 (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse7 (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse17)) (.cse8 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse9 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse10 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse12 (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (.cse13 (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 8))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse15) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse15) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2021-12-17 23:58:29,429 INFO L854 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 16))) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (<= .cse0 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (< |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| (+ |~#s_can_fail_allocator_static~0.offset| 1)) (<= |~#s_can_fail_allocator_static~0.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (<= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| .cse0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1|))) [2021-12-17 23:58:29,429 INFO L858 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2021-12-17 23:58:29,429 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-17 23:58:29,429 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-17 23:58:29,429 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-17 23:58:29,429 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-17 23:58:29,429 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-17 23:58:29,430 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-17 23:58:29,432 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:58:29,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 23:58:29,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:29,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:29,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:29,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:29,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:29,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:29,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:29,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:29,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:29,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:29,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:29,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:29,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:58:29 BoogieIcfgContainer [2021-12-17 23:58:29,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 23:58:29,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 23:58:29,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 23:58:29,449 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 23:58:29,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:58:10" (3/4) ... [2021-12-17 23:58:29,452 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 23:58:29,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2021-12-17 23:58:29,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2021-12-17 23:58:29,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-17 23:58:29,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2021-12-17 23:58:29,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-17 23:58:29,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-17 23:58:29,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-17 23:58:29,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-17 23:58:29,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-12-17 23:58:29,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-17 23:58:29,464 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2021-12-17 23:58:29,466 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2021-12-17 23:58:29,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-17 23:58:29,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-17 23:58:29,468 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-17 23:58:29,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 23:58:29,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 23:58:29,470 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 23:58:29,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(capacity == 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && buf < s_can_fail_allocator_static + 1) && 0 == buf) && buf == 0) && s_can_fail_allocator_static <= buf) && allocator == allocator) && buf == buf) && \result + 1 <= 0) || (((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity)) || ((((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && #memory_$Pointer$[buf][buf + 8] == 0) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) [2021-12-17 23:58:30,019 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 23:58:30,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 23:58:30,020 INFO L158 Benchmark]: Toolchain (without parser) took 22017.39ms. Allocated memory was 109.1MB in the beginning and 436.2MB in the end (delta: 327.2MB). Free memory was 70.2MB in the beginning and 325.1MB in the end (delta: -254.9MB). Peak memory consumption was 292.1MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,020 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 41.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 23:58:30,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1563.41ms. Allocated memory was 109.1MB in the beginning and 146.8MB in the end (delta: 37.7MB). Free memory was 69.8MB in the beginning and 80.0MB in the end (delta: -10.2MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.85ms. Allocated memory is still 146.8MB. Free memory was 80.0MB in the beginning and 69.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,021 INFO L158 Benchmark]: Boogie Preprocessor took 80.91ms. Allocated memory is still 146.8MB. Free memory was 69.5MB in the beginning and 63.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,021 INFO L158 Benchmark]: RCFGBuilder took 719.15ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 63.2MB in the beginning and 128.6MB in the end (delta: -65.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,021 INFO L158 Benchmark]: TraceAbstraction took 18932.86ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 127.6MB in the beginning and 376.2MB in the end (delta: -248.6MB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,022 INFO L158 Benchmark]: Witness Printer took 571.17ms. Allocated memory is still 436.2MB. Free memory was 376.2MB in the beginning and 325.1MB in the end (delta: 51.1MB). Peak memory consumption was 269.2MB. Max. memory is 16.1GB. [2021-12-17 23:58:30,022 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.15ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 41.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1563.41ms. Allocated memory was 109.1MB in the beginning and 146.8MB in the end (delta: 37.7MB). Free memory was 69.8MB in the beginning and 80.0MB in the end (delta: -10.2MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.85ms. Allocated memory is still 146.8MB. Free memory was 80.0MB in the beginning and 69.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.91ms. Allocated memory is still 146.8MB. Free memory was 69.5MB in the beginning and 63.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 719.15ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 63.2MB in the beginning and 128.6MB in the end (delta: -65.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18932.86ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 127.6MB in the beginning and 376.2MB in the end (delta: -248.6MB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. * Witness Printer took 571.17ms. Allocated memory is still 436.2MB. Free memory was 376.2MB in the beginning and 325.1MB in the end (delta: 51.1MB). Peak memory consumption was 269.2MB. 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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2042 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1897 mSDsluCounter, 15533 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 225 IncrementalHoareTripleChecker+Unchecked, 12564 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4346 IncrementalHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 2969 mSDtfsCounter, 4346 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 627 SyntacticMatches, 9 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=18, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 352 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 183 PreInvPairs, 206 NumberOfFragments, 1336 HoareAnnotationTreeSize, 183 FomulaSimplifications, 415 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 32 FomulaSimplificationsInter, 237269 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1817 NumberOfCodeBlocks, 1817 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1847 ConstructedInterpolants, 55 QuantifiedInterpolants, 10536 SizeOfPredicates, 38 NumberOfNonLiveVariables, 5076 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 541/579 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: 7110]: Loop Invariant [2021-12-17 23:58:30,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:30,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:30,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:30,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:30,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:30,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:30,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:30,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:30,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:30,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:58:30,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:58:30,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((!(capacity == 18446744073709551616 * (capacity / 18446744073709551616)) && allocator == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && buf < s_can_fail_allocator_static + 1) && 0 == buf) && buf == 0) && s_can_fail_allocator_static <= buf) && allocator == allocator) && buf == buf) && \result + 1 <= 0) || (((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity)) || ((((((((((((((((allocator == allocator && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && #memory_$Pointer$[buf][buf + 8] == 0) && buf < s_can_fail_allocator_static + 1) && buf == 0) && s_can_fail_allocator_static <= buf) && buf == buf) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == allocator) && !(0 == buf)) && capacity == capacity) && !(0 == buf)) && 0 == buf) && allocator == allocator) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-17 23:58:30,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE