./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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_from_array_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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:29:18,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:29:18,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:29:18,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:29:18,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:29:18,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:29:18,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:29:18,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:29:18,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:29:18,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:29:18,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:29:18,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:29:18,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:29:18,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:29:18,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:29:18,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:29:18,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:29:18,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:29:18,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:29:18,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:29:18,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:29:18,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:29:18,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:29:18,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:29:18,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:29:18,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:29:18,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:29:18,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:29:18,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:29:18,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:29:18,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:29:18,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:29:18,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:29:18,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:29:18,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:29:18,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:29:18,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:29:18,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:29:18,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:29:18,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:29:18,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:29:18,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:29:18,939 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:29:18,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:29:18,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:29:18,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:29:18,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:29:18,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:29:18,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:29:18,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:29:18,942 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:29:18,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:29:18,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:29:18,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:29:18,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:29:18,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:29:18,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:29:18,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:29:18,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:29:18,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:29:18,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:29:18,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:29:18,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:29:18,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:29:18,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:29:18,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:29:18,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:29:18,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:29:18,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:29:18,947 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:29:18,947 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:29:18,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:29:18,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:29:18,948 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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2021-11-16 20:29:19,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:29:19,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:29:19,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:29:19,205 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:29:19,207 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:29:19,208 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_from_array_harness.i [2021-11-16 20:29:19,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b9adb0/9871ba78963d428387c30ced1d7c0fb1/FLAG91eaccf07 [2021-11-16 20:29:19,944 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:29:19,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-16 20:29:19,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b9adb0/9871ba78963d428387c30ced1d7c0fb1/FLAG91eaccf07 [2021-11-16 20:29:20,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b9adb0/9871ba78963d428387c30ced1d7c0fb1 [2021-11-16 20:29:20,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:29:20,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:29:20,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:29:20,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:29:20,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:29:20,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:29:20" (1/1) ... [2021-11-16 20:29:20,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b799d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:20, skipping insertion in model container [2021-11-16 20:29:20,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:29:20" (1/1) ... [2021-11-16 20:29:20,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:29:20,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:29:20,622 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_from_array_harness.i[4497,4510] [2021-11-16 20:29:20,629 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_from_array_harness.i[4557,4570] [2021-11-16 20:29:20,644 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:29:20,648 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:29:21,195 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,196 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,197 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,198 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,199 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,216 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,216 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,218 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,218 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,522 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:29:21,524 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:29:21,525 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:29:21,526 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:29:21,529 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:29:21,530 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:29:21,531 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:29:21,532 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:29:21,533 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:29:21,534 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:29:21,641 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:29:21,740 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,753 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,794 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:29:21,833 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:29:21,844 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_from_array_harness.i[4497,4510] [2021-11-16 20:29:21,844 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_from_array_harness.i[4557,4570] [2021-11-16 20:29:21,846 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:29:21,846 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:29:21,870 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,871 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,871 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,871 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,872 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,876 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,876 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,877 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,877 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:21,904 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:29:21,905 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:29:21,905 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:29:21,906 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:29:21,906 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:29:21,907 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:29:21,907 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:29:21,908 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:29:21,908 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:29:21,908 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:29:21,931 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:29:22,013 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:22,014 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:29:22,042 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:29:22,256 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:29:22,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22 WrapperNode [2021-11-16 20:29:22,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:29:22,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:29:22,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:29:22,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:29:22,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,455 INFO L137 Inliner]: procedures = 692, calls = 2617, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 762 [2021-11-16 20:29:22,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:29:22,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:29:22,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:29:22,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:29:22,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:29:22,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:29:22,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:29:22,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:29:22,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (1/1) ... [2021-11-16 20:29:22,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:29:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:22,580 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-11-16 20:29:22,609 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-11-16 20:29:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-11-16 20:29:22,630 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-11-16 20:29:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:29:22,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:29:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:29:22,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:29:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:29:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:29:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:29:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:29:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 20:29:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:29:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2021-11-16 20:29:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2021-11-16 20:29:22,874 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:29:22,875 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:29:23,673 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:29:23,678 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:29:23,678 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 20:29:23,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:29:23 BoogieIcfgContainer [2021-11-16 20:29:23,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:29:23,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:29:23,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:29:23,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:29:23,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:29:20" (1/3) ... [2021-11-16 20:29:23,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c46949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:29:23, skipping insertion in model container [2021-11-16 20:29:23,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:22" (2/3) ... [2021-11-16 20:29:23,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c46949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:29:23, skipping insertion in model container [2021-11-16 20:29:23,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:29:23" (3/3) ... [2021-11-16 20:29:23,687 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2021-11-16 20:29:23,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:29:23,691 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:29:23,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:29:23,745 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-11-16 20:29:23,745 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:29:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-16 20:29:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-16 20:29:23,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:23,771 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] [2021-11-16 20:29:23,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash -537066619, now seen corresponding path program 1 times [2021-11-16 20:29:23,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:23,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069148325] [2021-11-16 20:29:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:23,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:24,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:24,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069148325] [2021-11-16 20:29:24,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069148325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:24,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:24,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-16 20:29:24,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95821523] [2021-11-16 20:29:24,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:24,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 20:29:24,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 20:29:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:29:24,368 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:24,531 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2021-11-16 20:29:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 20:29:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-11-16 20:29:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:24,544 INFO L225 Difference]: With dead ends: 145 [2021-11-16 20:29:24,545 INFO L226 Difference]: Without dead ends: 68 [2021-11-16 20:29:24,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:29:24,555 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:24,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:29:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-16 20:29:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-16 20:29:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-16 20:29:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2021-11-16 20:29:24,599 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 33 [2021-11-16 20:29:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:24,599 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2021-11-16 20:29:24,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2021-11-16 20:29:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-16 20:29:24,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:24,602 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] [2021-11-16 20:29:24,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:29:24,603 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash 365093061, now seen corresponding path program 1 times [2021-11-16 20:29:24,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:24,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301449521] [2021-11-16 20:29:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:24,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:24,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:24,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301449521] [2021-11-16 20:29:24,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301449521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:24,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:24,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:29:24,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222780194] [2021-11-16 20:29:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:24,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:29:24,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:29:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:29:24,882 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:25,107 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2021-11-16 20:29:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:29:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-11-16 20:29:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:25,110 INFO L225 Difference]: With dead ends: 123 [2021-11-16 20:29:25,110 INFO L226 Difference]: Without dead ends: 71 [2021-11-16 20:29:25,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:29:25,112 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:25,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 173 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-16 20:29:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-16 20:29:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2021-11-16 20:29:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2021-11-16 20:29:25,127 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 33 [2021-11-16 20:29:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:25,127 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2021-11-16 20:29:25,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2021-11-16 20:29:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-16 20:29:25,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:25,130 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] [2021-11-16 20:29:25,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 20:29:25,132 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1309209872, now seen corresponding path program 1 times [2021-11-16 20:29:25,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:25,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051606861] [2021-11-16 20:29:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:25,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:25,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:25,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051606861] [2021-11-16 20:29:25,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051606861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:25,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:25,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:29:25,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208573082] [2021-11-16 20:29:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:25,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:29:25,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:29:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:29:25,417 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:25,733 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2021-11-16 20:29:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:29:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2021-11-16 20:29:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:25,735 INFO L225 Difference]: With dead ends: 83 [2021-11-16 20:29:25,735 INFO L226 Difference]: Without dead ends: 81 [2021-11-16 20:29:25,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:29:25,736 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:25,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 376 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-16 20:29:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-11-16 20:29:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-11-16 20:29:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2021-11-16 20:29:25,744 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2021-11-16 20:29:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:25,744 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2021-11-16 20:29:25,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2021-11-16 20:29:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:25,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:25,746 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-11-16 20:29:25,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 20:29:25,746 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash -853000232, now seen corresponding path program 1 times [2021-11-16 20:29:25,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:25,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043234531] [2021-11-16 20:29:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:25,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:26,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:26,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043234531] [2021-11-16 20:29:26,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043234531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:26,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:26,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:29:26,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045007802] [2021-11-16 20:29:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:26,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:29:26,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:26,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:29:26,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:29:26,056 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:26,328 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2021-11-16 20:29:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:29:26,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-11-16 20:29:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:26,330 INFO L225 Difference]: With dead ends: 164 [2021-11-16 20:29:26,330 INFO L226 Difference]: Without dead ends: 105 [2021-11-16 20:29:26,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:29:26,331 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:26,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 217 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-16 20:29:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2021-11-16 20:29:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-11-16 20:29:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2021-11-16 20:29:26,340 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 43 [2021-11-16 20:29:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:26,341 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2021-11-16 20:29:26,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2021-11-16 20:29:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:26,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:26,343 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-11-16 20:29:26,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 20:29:26,343 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -594834794, now seen corresponding path program 1 times [2021-11-16 20:29:26,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:26,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913524291] [2021-11-16 20:29:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:26,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:26,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:26,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913524291] [2021-11-16 20:29:26,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913524291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:26,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:26,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:29:26,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199827210] [2021-11-16 20:29:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:26,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:29:26,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:29:26,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:29:26,738 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:27,168 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2021-11-16 20:29:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:29:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-11-16 20:29:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:27,170 INFO L225 Difference]: With dead ends: 180 [2021-11-16 20:29:27,170 INFO L226 Difference]: Without dead ends: 111 [2021-11-16 20:29:27,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:29:27,171 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 127 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:27,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 278 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:29:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-16 20:29:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2021-11-16 20:29:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-11-16 20:29:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-11-16 20:29:27,182 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 43 [2021-11-16 20:29:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:27,182 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-11-16 20:29:27,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-11-16 20:29:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:27,184 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:27,184 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-11-16 20:29:27,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 20:29:27,185 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1874698472, now seen corresponding path program 1 times [2021-11-16 20:29:27,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:27,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874911680] [2021-11-16 20:29:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:27,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-16 20:29:27,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:27,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874911680] [2021-11-16 20:29:27,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874911680] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:27,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959991009] [2021-11-16 20:29:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:27,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:27,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:27,767 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-11-16 20:29:27,772 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-11-16 20:29:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:28,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 2363 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:29:28,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:28,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:28,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:28,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:28,360 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 42 treesize of output 31 [2021-11-16 20:29:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:28,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:29:28,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959991009] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:28,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:29:28,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2021-11-16 20:29:28,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615902197] [2021-11-16 20:29:28,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:28,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:29:28,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:29:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:29:28,959 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:29,019 INFO L93 Difference]: Finished difference Result 233 states and 286 transitions. [2021-11-16 20:29:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:29:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-11-16 20:29:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:29,021 INFO L225 Difference]: With dead ends: 233 [2021-11-16 20:29:29,021 INFO L226 Difference]: Without dead ends: 119 [2021-11-16 20:29:29,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:29:29,022 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:29,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 327 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2021-11-16 20:29:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-16 20:29:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2021-11-16 20:29:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 92 states have internal predecessors, (104), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-11-16 20:29:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-11-16 20:29:29,031 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 43 [2021-11-16 20:29:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:29,031 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-11-16 20:29:29,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-11-16 20:29:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:29,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:29,033 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-11-16 20:29:29,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:29:29,247 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,SelfDestructingSolverStorable5 [2021-11-16 20:29:29,248 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 573755484, now seen corresponding path program 1 times [2021-11-16 20:29:29,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:29,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395919203] [2021-11-16 20:29:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:29,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:29,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:29,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:29,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395919203] [2021-11-16 20:29:29,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395919203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:29,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:29,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:29:29,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545923797] [2021-11-16 20:29:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:29,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:29:29,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:29:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:29:29,558 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:29,923 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2021-11-16 20:29:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:29:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-11-16 20:29:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:29,925 INFO L225 Difference]: With dead ends: 223 [2021-11-16 20:29:29,925 INFO L226 Difference]: Without dead ends: 140 [2021-11-16 20:29:29,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:29:29,926 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:29,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 271 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:29:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-16 20:29:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-11-16 20:29:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 98 states have internal predecessors, (112), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-11-16 20:29:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2021-11-16 20:29:29,936 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 43 [2021-11-16 20:29:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:29,936 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2021-11-16 20:29:29,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2021-11-16 20:29:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:29,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:29,938 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-11-16 20:29:29,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 20:29:29,939 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash 831920922, now seen corresponding path program 1 times [2021-11-16 20:29:29,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:29,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829924321] [2021-11-16 20:29:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:29,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:30,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:30,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829924321] [2021-11-16 20:29:30,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829924321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:30,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:30,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:29:30,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299551155] [2021-11-16 20:29:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:30,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:29:30,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:29:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:29:30,094 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:30,329 INFO L93 Difference]: Finished difference Result 236 states and 300 transitions. [2021-11-16 20:29:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:29:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-11-16 20:29:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:30,330 INFO L225 Difference]: With dead ends: 236 [2021-11-16 20:29:30,330 INFO L226 Difference]: Without dead ends: 147 [2021-11-16 20:29:30,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:29:30,331 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 55 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:30,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 226 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-16 20:29:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2021-11-16 20:29:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 98 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-11-16 20:29:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2021-11-16 20:29:30,339 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 43 [2021-11-16 20:29:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:30,340 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2021-11-16 20:29:30,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2021-11-16 20:29:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:30,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:30,341 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-11-16 20:29:30,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 20:29:30,341 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:30,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash -375980076, now seen corresponding path program 1 times [2021-11-16 20:29:30,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:30,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796009698] [2021-11-16 20:29:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:30,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:30,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:30,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796009698] [2021-11-16 20:29:30,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796009698] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:30,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:30,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:29:30,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745136661] [2021-11-16 20:29:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:30,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:29:30,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:29:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:29:30,682 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:31,194 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2021-11-16 20:29:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:29:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-11-16 20:29:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:31,196 INFO L225 Difference]: With dead ends: 221 [2021-11-16 20:29:31,196 INFO L226 Difference]: Without dead ends: 132 [2021-11-16 20:29:31,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:29:31,197 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:31,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 358 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:29:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-16 20:29:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2021-11-16 20:29:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 91 states have internal predecessors, (103), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-11-16 20:29:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2021-11-16 20:29:31,204 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 43 [2021-11-16 20:29:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:31,204 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2021-11-16 20:29:31,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2021-11-16 20:29:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 20:29:31,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:31,206 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-11-16 20:29:31,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 20:29:31,206 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:31,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1655843754, now seen corresponding path program 1 times [2021-11-16 20:29:31,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:31,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947543002] [2021-11-16 20:29:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:31,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:31,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:31,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947543002] [2021-11-16 20:29:31,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947543002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:31,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:31,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:29:31,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189606982] [2021-11-16 20:29:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:31,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:29:31,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:29:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:29:31,433 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:31,908 INFO L93 Difference]: Finished difference Result 227 states and 280 transitions. [2021-11-16 20:29:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:29:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-11-16 20:29:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:31,910 INFO L225 Difference]: With dead ends: 227 [2021-11-16 20:29:31,910 INFO L226 Difference]: Without dead ends: 140 [2021-11-16 20:29:31,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:29:31,911 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 113 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:31,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 302 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:29:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-16 20:29:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-11-16 20:29:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 98 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-11-16 20:29:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2021-11-16 20:29:31,918 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 43 [2021-11-16 20:29:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:31,918 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2021-11-16 20:29:31,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2021-11-16 20:29:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-16 20:29:31,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:31,920 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, 1, 1] [2021-11-16 20:29:31,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-16 20:29:31,920 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1365554723, now seen corresponding path program 1 times [2021-11-16 20:29:31,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:31,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390544463] [2021-11-16 20:29:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:31,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:32,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:32,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390544463] [2021-11-16 20:29:32,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390544463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:32,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:32,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:29:32,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323498426] [2021-11-16 20:29:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:32,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:29:32,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:29:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:29:32,043 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:32,192 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-11-16 20:29:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:29:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-11-16 20:29:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:32,193 INFO L225 Difference]: With dead ends: 217 [2021-11-16 20:29:32,193 INFO L226 Difference]: Without dead ends: 121 [2021-11-16 20:29:32,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:29:32,194 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:32,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 193 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:29:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-16 20:29:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2021-11-16 20:29:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-11-16 20:29:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2021-11-16 20:29:32,200 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 45 [2021-11-16 20:29:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:32,200 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2021-11-16 20:29:32,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2021-11-16 20:29:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-16 20:29:32,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:32,201 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, 1, 1] [2021-11-16 20:29:32,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 20:29:32,202 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2043381215, now seen corresponding path program 1 times [2021-11-16 20:29:32,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:32,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148009774] [2021-11-16 20:29:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:32,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:32,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:32,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148009774] [2021-11-16 20:29:32,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148009774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:32,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:32,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:29:32,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433070629] [2021-11-16 20:29:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:32,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:29:32,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:29:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:29:32,401 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:32,707 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2021-11-16 20:29:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:29:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-11-16 20:29:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:32,709 INFO L225 Difference]: With dead ends: 129 [2021-11-16 20:29:32,709 INFO L226 Difference]: Without dead ends: 127 [2021-11-16 20:29:32,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:29:32,710 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 64 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:32,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 471 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-16 20:29:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2021-11-16 20:29:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-11-16 20:29:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-11-16 20:29:32,716 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 45 [2021-11-16 20:29:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:32,716 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-11-16 20:29:32,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:29:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-11-16 20:29:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-16 20:29:32,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:32,717 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, 1, 1] [2021-11-16 20:29:32,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-16 20:29:32,717 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1342316637, now seen corresponding path program 1 times [2021-11-16 20:29:32,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:32,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748670026] [2021-11-16 20:29:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:32,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:33,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:33,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:33,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:33,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748670026] [2021-11-16 20:29:33,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748670026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:33,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:33,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-16 20:29:33,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085865571] [2021-11-16 20:29:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:33,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-16 20:29:33,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-16 20:29:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:29:33,271 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-16 20:29:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:34,170 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2021-11-16 20:29:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-16 20:29:34,170 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2021-11-16 20:29:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:34,172 INFO L225 Difference]: With dead ends: 131 [2021-11-16 20:29:34,172 INFO L226 Difference]: Without dead ends: 129 [2021-11-16 20:29:34,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2021-11-16 20:29:34,173 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 92 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:34,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 623 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:29:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-16 20:29:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-11-16 20:29:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-11-16 20:29:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-11-16 20:29:34,180 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 45 [2021-11-16 20:29:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:34,180 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-11-16 20:29:34,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-16 20:29:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-11-16 20:29:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-16 20:29:34,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:34,182 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, 1, 1] [2021-11-16 20:29:34,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-16 20:29:34,182 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1476330143, now seen corresponding path program 1 times [2021-11-16 20:29:34,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:34,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041181691] [2021-11-16 20:29:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:34,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 20:29:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 20:29:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:34,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:34,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041181691] [2021-11-16 20:29:34,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041181691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:34,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:34,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:29:34,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984929597] [2021-11-16 20:29:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:34,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:29:34,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:29:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:29:34,415 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:34,751 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2021-11-16 20:29:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:29:34,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2021-11-16 20:29:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:34,753 INFO L225 Difference]: With dead ends: 206 [2021-11-16 20:29:34,753 INFO L226 Difference]: Without dead ends: 123 [2021-11-16 20:29:34,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:29:34,754 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:34,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 250 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:29:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-16 20:29:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2021-11-16 20:29:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-11-16 20:29:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2021-11-16 20:29:34,759 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 45 [2021-11-16 20:29:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:34,759 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2021-11-16 20:29:34,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:29:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2021-11-16 20:29:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-16 20:29:34,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:34,761 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-16 20:29:34,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 20:29:34,761 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash 316076503, now seen corresponding path program 1 times [2021-11-16 20:29:34,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:34,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88329287] [2021-11-16 20:29:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:34,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 20:29:34,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:34,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88329287] [2021-11-16 20:29:34,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88329287] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:34,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168012232] [2021-11-16 20:29:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:34,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:34,911 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-11-16 20:29:34,920 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-11-16 20:29:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 2417 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:29:35,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 20:29:35,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:29:35,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168012232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:35,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:29:35,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-11-16 20:29:35,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075125599] [2021-11-16 20:29:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:35,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:29:35,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:29:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:29:35,421 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 20:29:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:35,439 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2021-11-16 20:29:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:29:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-11-16 20:29:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:35,441 INFO L225 Difference]: With dead ends: 201 [2021-11-16 20:29:35,441 INFO L226 Difference]: Without dead ends: 114 [2021-11-16 20:29:35,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:29:35,442 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:35,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 244 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:29:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-16 20:29:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2021-11-16 20:29:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 85 states have internal predecessors, (93), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-11-16 20:29:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2021-11-16 20:29:35,460 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 54 [2021-11-16 20:29:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:35,461 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2021-11-16 20:29:35,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 20:29:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2021-11-16 20:29:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-16 20:29:35,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:35,462 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-16 20:29:35,491 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-11-16 20:29:35,679 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,SelfDestructingSolverStorable14 [2021-11-16 20:29:35,679 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 691123421, now seen corresponding path program 1 times [2021-11-16 20:29:35,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:35,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746301274] [2021-11-16 20:29:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:35,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:29:35,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:35,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746301274] [2021-11-16 20:29:35,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746301274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:35,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:35,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 20:29:35,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730586800] [2021-11-16 20:29:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:35,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:29:35,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:29:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:29:35,857 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 20:29:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:36,069 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2021-11-16 20:29:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:29:36,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-11-16 20:29:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:36,070 INFO L225 Difference]: With dead ends: 140 [2021-11-16 20:29:36,071 INFO L226 Difference]: Without dead ends: 108 [2021-11-16 20:29:36,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:29:36,071 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:36,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 187 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-16 20:29:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-16 20:29:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-11-16 20:29:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2021-11-16 20:29:36,077 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 54 [2021-11-16 20:29:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:36,077 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2021-11-16 20:29:36,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 20:29:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2021-11-16 20:29:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-16 20:29:36,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:36,079 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] [2021-11-16 20:29:36,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-16 20:29:36,079 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -324954328, now seen corresponding path program 1 times [2021-11-16 20:29:36,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:36,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494940746] [2021-11-16 20:29:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:36,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-16 20:29:36,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:36,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494940746] [2021-11-16 20:29:36,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494940746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:36,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:36,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:29:36,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245595771] [2021-11-16 20:29:36,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:36,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:29:36,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:36,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:29:36,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:29:36,283 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-16 20:29:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:36,589 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2021-11-16 20:29:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:29:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2021-11-16 20:29:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:36,590 INFO L225 Difference]: With dead ends: 116 [2021-11-16 20:29:36,590 INFO L226 Difference]: Without dead ends: 114 [2021-11-16 20:29:36,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:29:36,591 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 92 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:36,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 355 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-16 20:29:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-11-16 20:29:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.130952380952381) internal successors, (95), 88 states have internal predecessors, (95), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2021-11-16 20:29:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-11-16 20:29:36,597 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 60 [2021-11-16 20:29:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:36,598 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-11-16 20:29:36,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-16 20:29:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-11-16 20:29:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-16 20:29:36,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:36,599 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, 1, 1, 1] [2021-11-16 20:29:36,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-16 20:29:36,599 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2057101486, now seen corresponding path program 1 times [2021-11-16 20:29:36,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:36,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093397003] [2021-11-16 20:29:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:36,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:29:36,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:36,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093397003] [2021-11-16 20:29:36,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093397003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:36,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:36,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 20:29:36,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436981971] [2021-11-16 20:29:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:36,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:29:36,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:36,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:29:36,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:29:36,991 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:37,733 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2021-11-16 20:29:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:29:37,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-11-16 20:29:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:37,735 INFO L225 Difference]: With dead ends: 173 [2021-11-16 20:29:37,735 INFO L226 Difference]: Without dead ends: 144 [2021-11-16 20:29:37,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:29:37,736 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 184 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:37,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 296 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:29:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-16 20:29:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2021-11-16 20:29:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 9 states have call predecessors, (19), 13 states have return successors, (28), 18 states have call predecessors, (28), 18 states have call successors, (28) [2021-11-16 20:29:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2021-11-16 20:29:37,744 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 64 [2021-11-16 20:29:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:37,744 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2021-11-16 20:29:37,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2021-11-16 20:29:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-16 20:29:37,745 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:37,746 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, 1, 1, 1] [2021-11-16 20:29:37,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-16 20:29:37,746 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash 777237808, now seen corresponding path program 1 times [2021-11-16 20:29:37,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:37,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996138190] [2021-11-16 20:29:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:37,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:37,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:37,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 20:29:38,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:38,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996138190] [2021-11-16 20:29:38,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996138190] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:38,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662753202] [2021-11-16 20:29:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:38,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:38,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:38,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:29:38,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 20:29:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:38,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-16 20:29:38,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:38,876 INFO L354 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2021-11-16 20:29:38,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 31 [2021-11-16 20:29:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:40,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:29:40,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662753202] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:40,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:29:40,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 28 [2021-11-16 20:29:40,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385643689] [2021-11-16 20:29:40,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:40,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:29:40,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:29:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2021-11-16 20:29:40,345 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:40,550 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2021-11-16 20:29:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 20:29:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-11-16 20:29:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:40,551 INFO L225 Difference]: With dead ends: 204 [2021-11-16 20:29:40,551 INFO L226 Difference]: Without dead ends: 163 [2021-11-16 20:29:40,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2021-11-16 20:29:40,553 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 25 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:40,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 602 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2021-11-16 20:29:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-16 20:29:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2021-11-16 20:29:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.131578947368421) internal successors, (129), 119 states have internal predecessors, (129), 21 states have call successors, (21), 11 states have call predecessors, (21), 16 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2021-11-16 20:29:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2021-11-16 20:29:40,561 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 64 [2021-11-16 20:29:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:40,561 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2021-11-16 20:29:40,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2021-11-16 20:29:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-16 20:29:40,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:40,563 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, 1] [2021-11-16 20:29:40,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-16 20:29:40,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:40,780 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1069275532, now seen corresponding path program 1 times [2021-11-16 20:29:40,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:40,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116589769] [2021-11-16 20:29:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:40,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:41,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 20:29:41,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:41,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116589769] [2021-11-16 20:29:41,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116589769] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:41,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768921940] [2021-11-16 20:29:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:41,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:41,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:29:41,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 20:29:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:41,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-16 20:29:41,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:42,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:42,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:42,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:42,074 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 42 treesize of output 31 [2021-11-16 20:29:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:29:43,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:29:43,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768921940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:43,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:29:43,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 26 [2021-11-16 20:29:43,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617149544] [2021-11-16 20:29:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:43,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:29:43,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:43,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:29:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:29:43,082 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:43,153 INFO L93 Difference]: Finished difference Result 208 states and 245 transitions. [2021-11-16 20:29:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 20:29:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-11-16 20:29:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:43,155 INFO L225 Difference]: With dead ends: 208 [2021-11-16 20:29:43,155 INFO L226 Difference]: Without dead ends: 161 [2021-11-16 20:29:43,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-11-16 20:29:43,157 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 11 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:43,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 674 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2021-11-16 20:29:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-16 20:29:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-11-16 20:29:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 122 states have (on average 1.1147540983606556) internal successors, (136), 128 states have internal predecessors, (136), 21 states have call successors, (21), 11 states have call predecessors, (21), 17 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2021-11-16 20:29:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2021-11-16 20:29:43,176 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 64 [2021-11-16 20:29:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:43,177 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2021-11-16 20:29:43,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2021-11-16 20:29:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-16 20:29:43,178 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:43,178 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, 1, 1, 1] [2021-11-16 20:29:43,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 20:29:43,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:43,396 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -418268106, now seen corresponding path program 1 times [2021-11-16 20:29:43,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:43,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574322082] [2021-11-16 20:29:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:43,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:29:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-16 20:29:43,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:43,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574322082] [2021-11-16 20:29:43,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574322082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:43,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:43,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:29:43,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549238867] [2021-11-16 20:29:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:43,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:29:43,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:29:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:29:43,846 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:29:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:44,625 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2021-11-16 20:29:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:29:44,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2021-11-16 20:29:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:44,627 INFO L225 Difference]: With dead ends: 184 [2021-11-16 20:29:44,627 INFO L226 Difference]: Without dead ends: 182 [2021-11-16 20:29:44,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:29:44,628 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 53 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:44,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 413 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 20:29:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-16 20:29:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2021-11-16 20:29:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 132 states have internal predecessors, (140), 24 states have call successors, (24), 12 states have call predecessors, (24), 18 states have return successors, (37), 24 states have call predecessors, (37), 23 states have call successors, (37) [2021-11-16 20:29:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2021-11-16 20:29:44,636 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 66 [2021-11-16 20:29:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:44,636 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2021-11-16 20:29:44,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:29:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2021-11-16 20:29:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-16 20:29:44,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:44,638 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, 1, 1, 1] [2021-11-16 20:29:44,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-16 20:29:44,638 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 820275769, now seen corresponding path program 1 times [2021-11-16 20:29:44,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:44,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838585903] [2021-11-16 20:29:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:44,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-16 20:29:44,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:44,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838585903] [2021-11-16 20:29:44,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838585903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:44,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:29:44,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-16 20:29:44,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495738437] [2021-11-16 20:29:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:44,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:29:44,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:29:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:29:44,864 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-16 20:29:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:45,240 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2021-11-16 20:29:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:29:45,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2021-11-16 20:29:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:45,242 INFO L225 Difference]: With dead ends: 185 [2021-11-16 20:29:45,242 INFO L226 Difference]: Without dead ends: 183 [2021-11-16 20:29:45,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:29:45,245 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 96 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:45,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 446 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:29:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-16 20:29:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 175. [2021-11-16 20:29:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 138 states have internal predecessors, (145), 24 states have call successors, (24), 12 states have call predecessors, (24), 19 states have return successors, (38), 24 states have call predecessors, (38), 23 states have call successors, (38) [2021-11-16 20:29:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 207 transitions. [2021-11-16 20:29:45,254 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 207 transitions. Word has length 66 [2021-11-16 20:29:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:45,254 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 207 transitions. [2021-11-16 20:29:45,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-16 20:29:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 207 transitions. [2021-11-16 20:29:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-16 20:29:45,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:45,256 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, 1, 1, 1] [2021-11-16 20:29:45,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-16 20:29:45,256 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1521340347, now seen corresponding path program 1 times [2021-11-16 20:29:45,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:45,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813990280] [2021-11-16 20:29:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:45,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:29:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:29:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 20:29:45,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:45,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813990280] [2021-11-16 20:29:45,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813990280] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:45,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892921278] [2021-11-16 20:29:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:45,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:45,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:45,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:29:45,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 20:29:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:46,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 2456 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:29:46,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:46,316 INFO L354 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2021-11-16 20:29:46,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 31 [2021-11-16 20:29:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:47,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:29:47,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892921278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:47,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:29:47,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2021-11-16 20:29:47,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001674100] [2021-11-16 20:29:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:47,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:29:47,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:29:47,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:29:47,548 INFO L87 Difference]: Start difference. First operand 175 states and 207 transitions. Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:47,649 INFO L93 Difference]: Finished difference Result 227 states and 265 transitions. [2021-11-16 20:29:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 20:29:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2021-11-16 20:29:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:47,650 INFO L225 Difference]: With dead ends: 227 [2021-11-16 20:29:47,651 INFO L226 Difference]: Without dead ends: 188 [2021-11-16 20:29:47,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:29:47,652 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 17 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:47,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 803 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 131 Unchecked, 0.1s Time] [2021-11-16 20:29:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-16 20:29:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-11-16 20:29:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.1126760563380282) internal successors, (158), 148 states have internal predecessors, (158), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (37), 24 states have call predecessors, (37), 23 states have call successors, (37) [2021-11-16 20:29:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 219 transitions. [2021-11-16 20:29:47,660 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 219 transitions. Word has length 66 [2021-11-16 20:29:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:47,661 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 219 transitions. [2021-11-16 20:29:47,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:29:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 219 transitions. [2021-11-16 20:29:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 20:29:47,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:47,662 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, 1, 1, 1] [2021-11-16 20:29:47,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:29:47,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-16 20:29:47,877 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1978442555, now seen corresponding path program 1 times [2021-11-16 20:29:47,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:47,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805006408] [2021-11-16 20:29:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:47,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:29:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:29:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 20:29:48,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:48,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805006408] [2021-11-16 20:29:48,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805006408] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:48,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912981706] [2021-11-16 20:29:48,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:48,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:48,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:48,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:29:48,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 20:29:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:48,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-16 20:29:48,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:48,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:48,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:29:48,950 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 42 treesize of output 31 [2021-11-16 20:29:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 20:29:49,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:29:49,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912981706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:29:49,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:29:49,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2021-11-16 20:29:49,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736019067] [2021-11-16 20:29:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:29:49,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:29:49,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:29:49,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:29:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2021-11-16 20:29:49,556 INFO L87 Difference]: Start difference. First operand 186 states and 219 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 20:29:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:29:49,617 INFO L93 Difference]: Finished difference Result 311 states and 358 transitions. [2021-11-16 20:29:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:29:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2021-11-16 20:29:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:29:49,619 INFO L225 Difference]: With dead ends: 311 [2021-11-16 20:29:49,619 INFO L226 Difference]: Without dead ends: 194 [2021-11-16 20:29:49,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2021-11-16 20:29:49,620 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:29:49,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 279 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2021-11-16 20:29:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-16 20:29:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-11-16 20:29:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.1133333333333333) internal successors, (167), 156 states have internal predecessors, (167), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (36), 24 states have call predecessors, (36), 23 states have call successors, (36) [2021-11-16 20:29:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2021-11-16 20:29:49,629 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 70 [2021-11-16 20:29:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:29:49,629 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2021-11-16 20:29:49,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 20:29:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2021-11-16 20:29:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 20:29:49,633 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:29:49,633 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, 1, 1, 1] [2021-11-16 20:29:49,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-16 20:29:49,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:49,860 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:29:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:29:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1584075769, now seen corresponding path program 1 times [2021-11-16 20:29:49,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:29:49,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947327898] [2021-11-16 20:29:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:49,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:29:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:29:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:29:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:29:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:29:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:29:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:29:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:29:50,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:29:50,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947327898] [2021-11-16 20:29:50,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947327898] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:29:50,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828501151] [2021-11-16 20:29:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:29:50,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:29:50,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:29:50,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:29:50,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 20:29:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:29:51,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 2463 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-16 20:29:51,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:29:51,369 INFO L354 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2021-11-16 20:29:51,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 31 [2021-11-16 20:29:53,440 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_from_array_~#buf~1.offset_BEFORE_CALL_9| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_9| Int)) (let ((.cse1 (select |c_#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_9|))) (let ((.cse0 (select .cse1 |v_aws_byte_buf_from_array_~#buf~1.offset_BEFORE_CALL_9|))) (and (= .cse0 (select .cse1 (+ 16 |v_aws_byte_buf_from_array_~#buf~1.offset_BEFORE_CALL_9|))) (< (div (+ 18446744073709551615 (* .cse0 (- 1))) (- 18446744073709551616)) (+ (div (+ .cse0 (- 1)) 18446744073709551616) 1)))))) is different from true [2021-11-16 20:30:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 15 not checked. [2021-11-16 20:30:37,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:30:46,290 INFO L354 Elim1Store]: treesize reduction 116, result has 0.9 percent of original size [2021-11-16 20:30:46,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 1 [2021-11-16 20:30:50,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828501151] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:30:50,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:30:50,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 38 [2021-11-16 20:30:50,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457695847] [2021-11-16 20:30:50,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 20:30:50,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-16 20:30:50,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:30:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-16 20:30:50,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1721, Unknown=26, NotChecked=84, Total=1980 [2021-11-16 20:30:50,512 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 38 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2021-11-16 20:32:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:19,526 INFO L93 Difference]: Finished difference Result 321 states and 366 transitions. [2021-11-16 20:32:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-16 20:32:19,531 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) Word has length 70 [2021-11-16 20:32:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:19,532 INFO L225 Difference]: With dead ends: 321 [2021-11-16 20:32:19,533 INFO L226 Difference]: Without dead ends: 224 [2021-11-16 20:32:19,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 146.3s TimeCoverageRelationStatistics Valid=585, Invalid=5522, Unknown=59, NotChecked=154, Total=6320 [2021-11-16 20:32:19,535 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 337 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1275 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:19,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 884 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1804 Invalid, 0 Unknown, 1275 Unchecked, 1.2s Time] [2021-11-16 20:32:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-16 20:32:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2021-11-16 20:32:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.0875) internal successors, (174), 165 states have internal predecessors, (174), 24 states have call successors, (24), 15 states have call predecessors, (24), 20 states have return successors, (33), 24 states have call predecessors, (33), 23 states have call successors, (33) [2021-11-16 20:32:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 231 transitions. [2021-11-16 20:32:19,545 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 231 transitions. Word has length 70 [2021-11-16 20:32:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:19,546 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 231 transitions. [2021-11-16 20:32:19,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2021-11-16 20:32:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 231 transitions. [2021-11-16 20:32:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 20:32:19,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:19,547 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:19,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 20:32:19,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:32:19,765 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 304212091, now seen corresponding path program 1 times [2021-11-16 20:32:19,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:19,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903579910] [2021-11-16 20:32:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:19,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:32:20,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:20,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903579910] [2021-11-16 20:32:20,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903579910] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:20,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:20,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 20:32:20,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594536897] [2021-11-16 20:32:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:20,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:32:20,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:20,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:32:20,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:32:20,320 INFO L87 Difference]: Start difference. First operand 205 states and 231 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:32:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:20,919 INFO L93 Difference]: Finished difference Result 263 states and 298 transitions. [2021-11-16 20:32:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:32:20,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2021-11-16 20:32:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:20,926 INFO L225 Difference]: With dead ends: 263 [2021-11-16 20:32:20,926 INFO L226 Difference]: Without dead ends: 222 [2021-11-16 20:32:20,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:32:20,927 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 113 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:20,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 345 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 20:32:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-16 20:32:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2021-11-16 20:32:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 158 states have internal predecessors, (166), 24 states have call successors, (24), 15 states have call predecessors, (24), 20 states have return successors, (33), 24 states have call predecessors, (33), 23 states have call successors, (33) [2021-11-16 20:32:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2021-11-16 20:32:20,939 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 70 [2021-11-16 20:32:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:20,939 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2021-11-16 20:32:20,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:32:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2021-11-16 20:32:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 20:32:20,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:20,941 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:20,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-16 20:32:20,941 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1542301249, now seen corresponding path program 1 times [2021-11-16 20:32:20,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:20,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383772584] [2021-11-16 20:32:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:20,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-16 20:32:21,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:21,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383772584] [2021-11-16 20:32:21,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383772584] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:32:21,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898616915] [2021-11-16 20:32:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:21,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:32:21,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:32:21,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:32:21,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 20:32:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:22,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 2460 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-16 20:32:22,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:32:22,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:32:22,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:32:22,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:32:22,943 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 27 treesize of output 17 [2021-11-16 20:32:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:32:24,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:32:24,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898616915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:24,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:32:24,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [22] total 33 [2021-11-16 20:32:24,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125420782] [2021-11-16 20:32:24,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:24,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:32:24,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:24,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:32:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-11-16 20:32:24,022 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:32:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:24,074 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2021-11-16 20:32:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:32:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2021-11-16 20:32:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:24,076 INFO L225 Difference]: With dead ends: 294 [2021-11-16 20:32:24,076 INFO L226 Difference]: Without dead ends: 242 [2021-11-16 20:32:24,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-11-16 20:32:24,078 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:24,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 503 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 105 Unchecked, 0.0s Time] [2021-11-16 20:32:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-16 20:32:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2021-11-16 20:32:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 159 states have (on average 1.069182389937107) internal successors, (170), 163 states have internal predecessors, (170), 26 states have call successors, (26), 17 states have call predecessors, (26), 22 states have return successors, (36), 27 states have call predecessors, (36), 25 states have call successors, (36) [2021-11-16 20:32:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 232 transitions. [2021-11-16 20:32:24,091 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 232 transitions. Word has length 70 [2021-11-16 20:32:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:24,091 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 232 transitions. [2021-11-16 20:32:24,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:32:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 232 transitions. [2021-11-16 20:32:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-16 20:32:24,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:24,093 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, 1, 1, 1] [2021-11-16 20:32:24,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-16 20:32:24,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-16 20:32:24,308 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2083530690, now seen corresponding path program 1 times [2021-11-16 20:32:24,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:24,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614383245] [2021-11-16 20:32:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:24,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:32:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:32:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:32:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:32:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-16 20:32:24,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:24,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614383245] [2021-11-16 20:32:24,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614383245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:24,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:24,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:32:24,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975223424] [2021-11-16 20:32:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:24,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:32:24,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:32:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:32:24,755 INFO L87 Difference]: Start difference. First operand 208 states and 232 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-16 20:32:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:25,495 INFO L93 Difference]: Finished difference Result 227 states and 255 transitions. [2021-11-16 20:32:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:32:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 72 [2021-11-16 20:32:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:25,505 INFO L225 Difference]: With dead ends: 227 [2021-11-16 20:32:25,505 INFO L226 Difference]: Without dead ends: 225 [2021-11-16 20:32:25,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:32:25,506 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 87 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:25,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 280 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:32:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-16 20:32:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2021-11-16 20:32:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 163 states have (on average 1.0674846625766872) internal successors, (174), 167 states have internal predecessors, (174), 27 states have call successors, (27), 18 states have call predecessors, (27), 23 states have return successors, (37), 28 states have call predecessors, (37), 26 states have call successors, (37) [2021-11-16 20:32:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 238 transitions. [2021-11-16 20:32:25,518 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 238 transitions. Word has length 72 [2021-11-16 20:32:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:25,518 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 238 transitions. [2021-11-16 20:32:25,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-16 20:32:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 238 transitions. [2021-11-16 20:32:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 20:32:25,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:25,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:25,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-16 20:32:25,520 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash 683060159, now seen corresponding path program 1 times [2021-11-16 20:32:25,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:25,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553824682] [2021-11-16 20:32:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:25,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:32:25,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:25,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553824682] [2021-11-16 20:32:25,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553824682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:25,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:25,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 20:32:25,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227504726] [2021-11-16 20:32:25,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:25,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:32:25,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:25,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:32:25,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:32:25,866 INFO L87 Difference]: Start difference. First operand 214 states and 238 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 20:32:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:26,713 INFO L93 Difference]: Finished difference Result 266 states and 296 transitions. [2021-11-16 20:32:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:32:26,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2021-11-16 20:32:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:26,714 INFO L225 Difference]: With dead ends: 266 [2021-11-16 20:32:26,715 INFO L226 Difference]: Without dead ends: 219 [2021-11-16 20:32:26,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:32:26,716 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 89 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:26,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 281 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 20:32:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-16 20:32:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 204. [2021-11-16 20:32:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 154 states have (on average 1.0649350649350648) internal successors, (164), 157 states have internal predecessors, (164), 27 states have call successors, (27), 18 states have call predecessors, (27), 22 states have return successors, (36), 28 states have call predecessors, (36), 26 states have call successors, (36) [2021-11-16 20:32:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 227 transitions. [2021-11-16 20:32:26,764 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 227 transitions. Word has length 70 [2021-11-16 20:32:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:26,764 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 227 transitions. [2021-11-16 20:32:26,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 20:32:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 227 transitions. [2021-11-16 20:32:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-16 20:32:26,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:26,765 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:26,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-16 20:32:26,765 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807610, now seen corresponding path program 1 times [2021-11-16 20:32:26,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:26,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480982903] [2021-11-16 20:32:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:26,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:32:27,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:27,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480982903] [2021-11-16 20:32:27,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480982903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:27,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:27,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-16 20:32:27,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396715665] [2021-11-16 20:32:27,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:27,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-16 20:32:27,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-16 20:32:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2021-11-16 20:32:27,436 INFO L87 Difference]: Start difference. First operand 204 states and 227 transitions. Second operand has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-16 20:32:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:28,707 INFO L93 Difference]: Finished difference Result 225 states and 250 transitions. [2021-11-16 20:32:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-16 20:32:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2021-11-16 20:32:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:28,708 INFO L225 Difference]: With dead ends: 225 [2021-11-16 20:32:28,709 INFO L226 Difference]: Without dead ends: 223 [2021-11-16 20:32:28,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2021-11-16 20:32:28,709 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:28,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 723 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-16 20:32:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-16 20:32:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2021-11-16 20:32:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 157 states have (on average 1.0636942675159236) internal successors, (167), 160 states have internal predecessors, (167), 26 states have call successors, (26), 19 states have call predecessors, (26), 23 states have return successors, (35), 27 states have call predecessors, (35), 25 states have call successors, (35) [2021-11-16 20:32:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2021-11-16 20:32:28,740 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 72 [2021-11-16 20:32:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:28,740 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2021-11-16 20:32:28,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-16 20:32:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2021-11-16 20:32:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-16 20:32:28,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:28,742 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:28,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-16 20:32:28,742 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1210932874, now seen corresponding path program 1 times [2021-11-16 20:32:28,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:28,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695779054] [2021-11-16 20:32:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:28,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:28,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:32:29,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:29,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695779054] [2021-11-16 20:32:29,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695779054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:29,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:29,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-16 20:32:29,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391774266] [2021-11-16 20:32:29,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:29,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:32:29,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:32:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:32:29,059 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 20:32:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:29,773 INFO L93 Difference]: Finished difference Result 254 states and 280 transitions. [2021-11-16 20:32:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:32:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2021-11-16 20:32:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:29,775 INFO L225 Difference]: With dead ends: 254 [2021-11-16 20:32:29,775 INFO L226 Difference]: Without dead ends: 217 [2021-11-16 20:32:29,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:32:29,776 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:29,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 266 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:32:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-16 20:32:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2021-11-16 20:32:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.0636942675159236) internal successors, (167), 160 states have internal predecessors, (167), 25 states have call successors, (25), 19 states have call predecessors, (25), 23 states have return successors, (33), 26 states have call predecessors, (33), 24 states have call successors, (33) [2021-11-16 20:32:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 225 transitions. [2021-11-16 20:32:29,787 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 225 transitions. Word has length 72 [2021-11-16 20:32:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:29,788 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 225 transitions. [2021-11-16 20:32:29,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 20:32:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 225 transitions. [2021-11-16 20:32:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-16 20:32:29,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:29,789 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, 1, 1, 1] [2021-11-16 20:32:29,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-16 20:32:29,789 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1862370124, now seen corresponding path program 1 times [2021-11-16 20:32:29,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:29,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798583379] [2021-11-16 20:32:29,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:29,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:32:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:32:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:32:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:32:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-16 20:32:30,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:30,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798583379] [2021-11-16 20:32:30,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798583379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:30,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:30,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:32:30,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439621483] [2021-11-16 20:32:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:30,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:32:30,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:32:30,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:32:30,040 INFO L87 Difference]: Start difference. First operand 206 states and 225 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-16 20:32:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:30,452 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2021-11-16 20:32:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:32:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2021-11-16 20:32:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:30,453 INFO L225 Difference]: With dead ends: 212 [2021-11-16 20:32:30,453 INFO L226 Difference]: Without dead ends: 210 [2021-11-16 20:32:30,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:32:30,454 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:30,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 222 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:32:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-16 20:32:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-16 20:32:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.0625) internal successors, (170), 163 states have internal predecessors, (170), 25 states have call successors, (25), 20 states have call predecessors, (25), 24 states have return successors, (33), 26 states have call predecessors, (33), 24 states have call successors, (33) [2021-11-16 20:32:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2021-11-16 20:32:30,466 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 78 [2021-11-16 20:32:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:30,466 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2021-11-16 20:32:30,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-16 20:32:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2021-11-16 20:32:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-16 20:32:30,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:30,468 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:30,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-16 20:32:30,468 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1313070, now seen corresponding path program 1 times [2021-11-16 20:32:30,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:30,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336372578] [2021-11-16 20:32:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:30,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 20:32:30,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:30,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336372578] [2021-11-16 20:32:30,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336372578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:30,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:30,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-16 20:32:30,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383701113] [2021-11-16 20:32:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:30,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 20:32:30,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:30,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 20:32:30,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:32:30,878 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-16 20:32:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:31,574 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2021-11-16 20:32:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:32:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 78 [2021-11-16 20:32:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:31,577 INFO L225 Difference]: With dead ends: 258 [2021-11-16 20:32:31,578 INFO L226 Difference]: Without dead ends: 221 [2021-11-16 20:32:31,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-11-16 20:32:31,579 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 130 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:31,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 411 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:32:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-16 20:32:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2021-11-16 20:32:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.0625) internal successors, (170), 163 states have internal predecessors, (170), 25 states have call successors, (25), 20 states have call predecessors, (25), 24 states have return successors, (32), 26 states have call predecessors, (32), 24 states have call successors, (32) [2021-11-16 20:32:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2021-11-16 20:32:31,591 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 78 [2021-11-16 20:32:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:31,591 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2021-11-16 20:32:31,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-16 20:32:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2021-11-16 20:32:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-16 20:32:31,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:31,593 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:31,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-16 20:32:31,593 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1589660972, now seen corresponding path program 1 times [2021-11-16 20:32:31,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:31,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416204803] [2021-11-16 20:32:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:31,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-16 20:32:32,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:32,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416204803] [2021-11-16 20:32:32,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416204803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:32,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:32,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:32:32,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054542056] [2021-11-16 20:32:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:32,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:32:32,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:32:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:32:32,040 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:32:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:32,668 INFO L93 Difference]: Finished difference Result 227 states and 247 transitions. [2021-11-16 20:32:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:32:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2021-11-16 20:32:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:32,670 INFO L225 Difference]: With dead ends: 227 [2021-11-16 20:32:32,670 INFO L226 Difference]: Without dead ends: 225 [2021-11-16 20:32:32,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:32:32,670 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 84 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:32,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 438 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 20:32:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-16 20:32:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2021-11-16 20:32:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 163 states have (on average 1.0613496932515338) internal successors, (173), 166 states have internal predecessors, (173), 25 states have call successors, (25), 21 states have call predecessors, (25), 25 states have return successors, (32), 26 states have call predecessors, (32), 24 states have call successors, (32) [2021-11-16 20:32:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2021-11-16 20:32:32,683 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 78 [2021-11-16 20:32:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:32,683 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2021-11-16 20:32:32,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:32:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2021-11-16 20:32:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-16 20:32:32,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:32,684 INFO L514 BasicCegarLoop]: trace histogram [6, 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] [2021-11-16 20:32:32,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-16 20:32:32,685 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1440681711, now seen corresponding path program 1 times [2021-11-16 20:32:32,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:32,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854120584] [2021-11-16 20:32:32,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:32,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 20:32:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:32:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:32:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:32:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 20:32:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-16 20:32:32,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:32,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854120584] [2021-11-16 20:32:32,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854120584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:32,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:32,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:32:32,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888912331] [2021-11-16 20:32:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:32,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:32:32,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:32,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:32:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:32:32,933 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 20:32:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:33,368 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2021-11-16 20:32:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:32:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2021-11-16 20:32:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:33,369 INFO L225 Difference]: With dead ends: 238 [2021-11-16 20:32:33,369 INFO L226 Difference]: Without dead ends: 101 [2021-11-16 20:32:33,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:32:33,370 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:33,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 279 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:32:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-16 20:32:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-11-16 20:32:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 75 states have internal predecessors, (75), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-16 20:32:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2021-11-16 20:32:33,375 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 85 [2021-11-16 20:32:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:33,375 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2021-11-16 20:32:33,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 20:32:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2021-11-16 20:32:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-16 20:32:33,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:33,376 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:33,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-16 20:32:33,377 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 61222880, now seen corresponding path program 1 times [2021-11-16 20:32:33,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:33,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105562014] [2021-11-16 20:32:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:33,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 20:32:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-16 20:32:33,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:33,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105562014] [2021-11-16 20:32:33,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105562014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:33,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:33,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:32:33,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471365398] [2021-11-16 20:32:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:33,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:32:33,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:32:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:32:33,810 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-16 20:32:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:34,354 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2021-11-16 20:32:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:32:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2021-11-16 20:32:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:34,355 INFO L225 Difference]: With dead ends: 107 [2021-11-16 20:32:34,355 INFO L226 Difference]: Without dead ends: 105 [2021-11-16 20:32:34,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:32:34,356 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:34,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:32:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-16 20:32:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-16 20:32:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 78 states have internal predecessors, (78), 15 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-16 20:32:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2021-11-16 20:32:34,362 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 84 [2021-11-16 20:32:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:34,362 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2021-11-16 20:32:34,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-16 20:32:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2021-11-16 20:32:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-16 20:32:34,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:34,363 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:34,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-16 20:32:34,363 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795247, now seen corresponding path program 1 times [2021-11-16 20:32:34,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:34,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517478401] [2021-11-16 20:32:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:34,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 20:32:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:32:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 20:32:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-16 20:32:34,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:34,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517478401] [2021-11-16 20:32:34,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517478401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:34,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:34,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-16 20:32:34,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634402625] [2021-11-16 20:32:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:34,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 20:32:34,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 20:32:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:32:34,695 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-16 20:32:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:35,196 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2021-11-16 20:32:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 20:32:35,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 97 [2021-11-16 20:32:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:35,199 INFO L225 Difference]: With dead ends: 111 [2021-11-16 20:32:35,199 INFO L226 Difference]: Without dead ends: 107 [2021-11-16 20:32:35,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-11-16 20:32:35,200 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 50 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:35,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 238 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:32:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-16 20:32:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-11-16 20:32:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.0) internal successors, (79), 79 states have internal predecessors, (79), 15 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-16 20:32:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-11-16 20:32:35,206 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 97 [2021-11-16 20:32:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:35,208 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-11-16 20:32:35,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-16 20:32:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-11-16 20:32:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 20:32:35,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:32:35,209 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:35,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-16 20:32:35,210 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:32:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:32:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 654673100, now seen corresponding path program 1 times [2021-11-16 20:32:35,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:32:35,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185321744] [2021-11-16 20:32:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:32:35,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:32:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:32:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:32:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:32:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:32:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:32:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:32:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:32:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 20:32:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:32:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 20:32:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 20:32:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:32:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:32:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:32:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-11-16 20:32:36,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:32:36,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185321744] [2021-11-16 20:32:36,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185321744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:32:36,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:32:36,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-16 20:32:36,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583319625] [2021-11-16 20:32:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:32:36,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-16 20:32:36,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:32:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-16 20:32:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:32:36,768 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-11-16 20:32:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:32:37,358 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2021-11-16 20:32:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 20:32:37,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 114 [2021-11-16 20:32:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:32:37,359 INFO L225 Difference]: With dead ends: 107 [2021-11-16 20:32:37,359 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 20:32:37,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:32:37,360 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:32:37,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 254 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 20:32:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 20:32:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 20:32:37,360 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-11-16 20:32:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 20:32:37,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2021-11-16 20:32:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:32:37,361 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 20:32:37,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-11-16 20:32:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 20:32:37,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 20:32:37,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 20:32:37,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-16 20:32:37,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 20:32:41,816 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-16 20:32:41,816 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-11-16 20:32:41,816 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-11-16 20:32:41,816 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-11-16 20:32:41,816 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-16 20:32:41,816 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,817 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L854 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse13 (select .cse18 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16))) (.cse15 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse12 (select .cse18 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse16 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse14 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse17 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse8 (select .cse14 .cse17)) (.cse2 (select .cse16 .cse17)) (.cse0 (<= |aws_byte_buf_from_array_#in~len| .cse12)) (.cse1 (= (select .cse16 .cse15) 0)) (.cse3 (= (select .cse14 .cse15) 0)) (.cse4 (<= |aws_byte_buf_from_array_#in~len| .cse13)) (.cse5 (<= .cse13 |aws_byte_buf_from_array_#in~len|)) (.cse6 (<= .cse12 |aws_byte_buf_from_array_#in~len|)) (.cse7 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse9 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse10 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse11 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse0 .cse1 (= .cse2 |aws_byte_buf_from_array_#in~bytes.offset|) .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 |aws_byte_buf_from_array_#in~bytes.base|) .cse9 (<= 1 (+ (* 18446744073709551616 (div (+ (* |aws_byte_buf_from_array_#in~len| (- 1)) 18446744073709551615) 18446744073709551616)) |aws_byte_buf_from_array_#in~len|)) .cse10 .cse11) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= .cse8 0) (= .cse2 0) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (<= (mod aws_byte_buf_from_array_~len 18446744073709551616) 0)))))) [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L854 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse24 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse19 (select .cse24 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse18 (select .cse24 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16))) (.cse21 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse22 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse0 (= |aws_byte_buf_from_array_#in~bytes.base| 0)) (.cse20 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse23 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse11 (select .cse20 .cse23)) (.cse1 (not .cse0)) (.cse4 (select .cse22 .cse23)) (.cse2 (<= 1 |aws_byte_buf_from_array_#t~ret1053|)) (.cse3 (= (select .cse22 .cse21) 0)) (.cse5 (= (select .cse20 .cse21) 0)) (.cse6 (<= |aws_byte_buf_from_array_#t~ret1053| 1)) (.cse7 (<= |aws_byte_buf_from_array_#in~len| .cse18)) (.cse8 (<= .cse19 |aws_byte_buf_from_array_#in~len|)) (.cse9 (<= .cse19 .cse18)) (.cse10 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse12 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse13 (not (= aws_byte_buf_from_array_~bytes.base 0))) (.cse15 (* |aws_byte_buf_from_array_#in~len| (- 1))) (.cse14 (<= .cse18 .cse19)) (.cse16 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse17 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or .cse0 (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse1 .cse2 .cse3 (= .cse4 |aws_byte_buf_from_array_#in~bytes.offset|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |aws_byte_buf_from_array_#in~bytes.base|) .cse12 .cse13 .cse14 (<= 1 (+ (* 18446744073709551616 (div (+ .cse15 18446744073709551615) 18446744073709551616)) |aws_byte_buf_from_array_#in~len|)) .cse16 .cse17) (and (= .cse11 0) .cse1 (= .cse4 0) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (<= 0 (+ (* 18446744073709551616 (div .cse15 18446744073709551616)) |aws_byte_buf_from_array_#in~len|)) .cse14 .cse16 .cse17))))) [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L858 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2021-11-16 20:32:41,818 INFO L854 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) [2021-11-16 20:32:41,819 INFO L858 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2021-11-16 20:32:41,819 INFO L854 garLoopResultBuilder]: At program point aws_byte_buf_from_arrayENTRY(lines 8203 8216) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (= |aws_byte_buf_from_array_#in~bytes.base| 0)) [2021-11-16 20:32:41,819 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2021-11-16 20:32:41,819 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-11-16 20:32:41,819 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-11-16 20:32:41,819 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-11-16 20:32:41,819 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 20:32:41,819 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-11-16 20:32:41,820 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-11-16 20:32:41,820 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-11-16 20:32:41,820 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:32:41,820 INFO L854 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse9 .cse12) 0)) (.cse2 (= (select .cse11 .cse12) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1.base| 0)) (.cse6 (= (select .cse11 .cse10) 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse9 .cse10))) (or (and .cse0 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= .cse5 0))))) [2021-11-16 20:32:41,820 INFO L858 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2021-11-16 20:32:41,820 INFO L854 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18410715276690587648) 18446744073709551616)) (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) [2021-11-16 20:32:41,821 INFO L858 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2021-11-16 20:32:41,821 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse16 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse5 (select .cse16 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse12 .cse15) 0)) (.cse2 (= (select .cse14 .cse15) 0)) (.cse3 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse14 .cse13) 0)) (.cse8 (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1211#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse6 (select .cse12 .cse13))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse11 (* 18446744073709551616 (div .cse11 18446744073709551616))) .cse7 .cse8 .cse9 .cse10 (= .cse6 0)))))) [2021-11-16 20:32:41,821 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-11-16 20:32:41,821 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-11-16 20:32:41,821 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:32:41,821 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 20:32:41,822 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 20:32:41,822 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 20:32:41,822 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-16 20:32:41,822 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2021-11-16 20:32:41,822 INFO L861 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2021-11-16 20:32:41,822 INFO L858 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2021-11-16 20:32:41,822 INFO L854 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse13 .cse14) 0)) (.cse2 (= (select .cse11 .cse14) 0)) (.cse3 (= (select .cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse8 (select .cse13 .cse12)) (.cse6 (= (select .cse11 .cse12) 0)) (.cse5 (select .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse2 .cse3 .cse4 (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616))) .cse6 .cse7 (= .cse8 0) .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) 18446744073709551616)))) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse8) .cse6 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse7 .cse9)))) [2021-11-16 20:32:41,823 INFO L858 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2021-11-16 20:32:41,823 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:32:41,823 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-11-16 20:32:41,823 INFO L858 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2021-11-16 20:32:41,823 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:32:41,823 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse11 (select .cse19 .cse17)) (.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse19 .cse18) 0)) (.cse1 (= (select .cse16 .cse18) 0)) (.cse9 (= .cse11 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= (select .cse16 .cse17) 0)) (.cse5 (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 .cse4 .cse5 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_9| Int)) (let ((.cse7 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_9|))) (let ((.cse6 (select .cse7 16))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) .cse6) (= (select .cse7 0) .cse6) (<= (div (* .cse6 (- 1)) (- 18446744073709551616)) (div .cse6 18446744073709551616)))))) .cse8 .cse9) (and .cse0 (<= .cse10 (+ (* 18446744073709551616 (div (+ (- 1) .cse10) 18446744073709551616)) 36028797018963967)) .cse1 (not .cse9) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse11) .cse4 .cse5 .cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_21| Int)) (let ((.cse15 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_21|))) (let ((.cse13 (select .cse15 16)) (.cse14 (select .cse15 0)) (.cse12 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= (select .cse12 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) .cse13) (= .cse14 .cse13) (= .cse14 (select .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))))))) [2021-11-16 20:32:41,824 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse5 (select .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse12 (select .cse17 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse15 .cse16) 0)) (.cse2 (= (select .cse13 .cse16) 0)) (.cse3 (= .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse10 (select .cse15 .cse14)) (.cse6 (= (select .cse13 .cse14) 0)) (.cse7 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1210#1| 1)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse11 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1210#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616))) .cse6 .cse7 .cse8 .cse9 (= .cse10 0) .cse11) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (<= .cse12 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse12) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse10) .cse6 .cse7 .cse8 .cse9 .cse11))))) [2021-11-16 20:32:41,824 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-11-16 20:32:41,824 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-11-16 20:32:41,824 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 20:32:41,824 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 20:32:41,824 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 20:32:41,825 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 20:32:41,825 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 20:32:41,825 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 20:32:41,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:32:41,830 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 20:32:41,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:32:41 BoogieIcfgContainer [2021-11-16 20:32:41,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 20:32:41,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 20:32:41,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 20:32:41,839 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 20:32:41,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:29:23" (3/4) ... [2021-11-16 20:32:41,842 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 20:32:41,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-11-16 20:32:41,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2021-11-16 20:32:41,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-11-16 20:32:41,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-11-16 20:32:41,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 20:32:41,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 20:32:41,859 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2021-11-16 20:32:41,860 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-11-16 20:32:41,861 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-16 20:32:41,862 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-16 20:32:41,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 20:32:41,864 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 20:32:41,865 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 20:32:41,865 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 20:32:42,494 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 20:32:42,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 20:32:42,495 INFO L158 Benchmark]: Toolchain (without parser) took 202205.44ms. Allocated memory was 86.0MB in the beginning and 446.7MB in the end (delta: 360.7MB). Free memory was 46.1MB in the beginning and 313.5MB in the end (delta: -267.4MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,495 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 20:32:42,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1966.90ms. Allocated memory was 86.0MB in the beginning and 146.8MB in the end (delta: 60.8MB). Free memory was 45.7MB in the beginning and 76.4MB in the end (delta: -30.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 197.80ms. Allocated memory is still 146.8MB. Free memory was 75.8MB in the beginning and 65.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,496 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 146.8MB. Free memory was 65.3MB in the beginning and 59.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,496 INFO L158 Benchmark]: RCFGBuilder took 1155.60ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 59.0MB in the beginning and 117.7MB in the end (delta: -58.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,496 INFO L158 Benchmark]: TraceAbstraction took 198156.81ms. Allocated memory was 176.2MB in the beginning and 446.7MB in the end (delta: 270.5MB). Free memory was 117.7MB in the beginning and 342.4MB in the end (delta: -224.7MB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,496 INFO L158 Benchmark]: Witness Printer took 655.68ms. Allocated memory is still 446.7MB. Free memory was 342.4MB in the beginning and 313.5MB in the end (delta: 28.9MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. [2021-11-16 20:32:42,497 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.17ms. Allocated memory is still 86.0MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1966.90ms. Allocated memory was 86.0MB in the beginning and 146.8MB in the end (delta: 60.8MB). Free memory was 45.7MB in the beginning and 76.4MB in the end (delta: -30.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 197.80ms. Allocated memory is still 146.8MB. Free memory was 75.8MB in the beginning and 65.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 146.8MB. Free memory was 65.3MB in the beginning and 59.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1155.60ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 59.0MB in the beginning and 117.7MB in the end (delta: -58.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 198156.81ms. Allocated memory was 176.2MB in the beginning and 446.7MB in the end (delta: 270.5MB). Free memory was 117.7MB in the beginning and 342.4MB in the end (delta: -224.7MB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. * Witness Printer took 655.68ms. Allocated memory is still 446.7MB. Free memory was 342.4MB in the beginning and 313.5MB in the end (delta: 28.9MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 198.1s, OverallIterations: 38, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 104.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3132 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2929 mSDsluCounter, 13818 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1785 IncrementalHoareTripleChecker+Unchecked, 10920 mSDsCounter, 1072 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15819 IncrementalHoareTripleChecker+Invalid, 18676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1072 mSolverCounterUnsat, 2898 mSDtfsCounter, 15819 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1698 GetRequests, 989 SyntacticMatches, 21 SemanticMatches, 688 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 156.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=28, InterpolantAutomatonStates: 457, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 38 MinimizatonAttempts, 384 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 278 PreInvPairs, 301 NumberOfFragments, 1749 HoareAnnotationTreeSize, 278 FomulaSimplifications, 5256 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 394087 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 77.4s InterpolantComputationTime, 2825 NumberOfCodeBlocks, 2825 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2779 ConstructedInterpolants, 216 QuantifiedInterpolants, 21751 SizeOfPredicates, 66 NumberOfNonLiveVariables, 19507 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 832/897 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: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-16 20:32:42,723 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-16 20:32:42,755 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE