./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:30:17,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:30:17,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:30:17,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:30:17,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:30:17,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:30:17,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:30:17,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:30:17,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:30:17,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:30:17,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:30:17,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:30:17,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:30:17,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:30:17,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:30:17,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:30:17,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:30:17,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:30:17,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:30:17,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:30:17,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:30:17,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:30:17,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:30:17,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:30:17,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:30:17,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:30:17,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:30:17,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:30:17,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:30:17,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:30:17,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:30:17,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:30:17,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:30:17,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:30:17,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:30:17,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:30:17,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:30:17,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:30:17,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:30:17,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:30:17,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:30:17,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 15:30:18,011 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:30:18,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:30:18,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:30:18,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:30:18,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:30:18,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:30:18,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:30:18,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:30:18,014 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:30:18,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:30:18,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:30:18,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:30:18,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:30:18,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:30:18,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:30:18,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:30:18,015 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:30:18,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:30:18,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:30:18,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:30:18,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:30:18,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:30:18,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:30:18,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:30:18,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:30:18,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:30:18,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:30:18,017 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:30:18,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:30:18,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:30:18,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:30:18,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2021-12-21 15:30:18,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:30:18,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:30:18,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:30:18,324 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:30:18,325 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:30:18,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-21 15:30:18,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32cfb193/5f827d6cf98d4bfb9cf5b9b4a16c291a/FLAGcfb2a2d3f [2021-12-21 15:30:19,077 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:30:19,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-21 15:30:19,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32cfb193/5f827d6cf98d4bfb9cf5b9b4a16c291a/FLAGcfb2a2d3f [2021-12-21 15:30:19,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32cfb193/5f827d6cf98d4bfb9cf5b9b4a16c291a [2021-12-21 15:30:19,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:30:19,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:30:19,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:30:19,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:30:19,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:30:19,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:30:19" (1/1) ... [2021-12-21 15:30:19,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289a30ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:19, skipping insertion in model container [2021-12-21 15:30:19,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:30:19" (1/1) ... [2021-12-21 15:30:19,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:30:19,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:30:19,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-12-21 15:30:19,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-12-21 15:30:20,185 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,188 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,188 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,189 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,191 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,210 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,211 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,212 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,213 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,508 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-21 15:30:20,509 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-21 15:30:20,510 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-21 15:30:20,511 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-21 15:30:20,512 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-21 15:30:20,513 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-21 15:30:20,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-21 15:30:20,515 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-21 15:30:20,517 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-21 15:30:20,518 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-21 15:30:20,701 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-21 15:30:20,757 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,758 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:30:20,865 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:30:20,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-12-21 15:30:20,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-12-21 15:30:20,905 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,906 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,906 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,907 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,907 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,912 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,913 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,914 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,914 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:20,939 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-21 15:30:20,940 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-21 15:30:20,941 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-21 15:30:20,941 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-21 15:30:20,942 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-21 15:30:20,942 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-21 15:30:20,943 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-21 15:30:20,943 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-21 15:30:20,944 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-21 15:30:20,944 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-21 15:30:20,960 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-21 15:30:21,009 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:21,010 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:30:21,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:30:21,274 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:30:21,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21 WrapperNode [2021-12-21 15:30:21,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:30:21,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:30:21,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:30:21,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:30:21,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,459 INFO L137 Inliner]: procedures = 690, calls = 2496, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 779 [2021-12-21 15:30:21,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:30:21,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:30:21,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:30:21,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:30:21,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:30:21,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:30:21,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:30:21,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:30:21,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (1/1) ... [2021-12-21 15:30:21,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:30:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:30:21,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 15:30:21,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 15:30:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-21 15:30:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-21 15:30:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:30:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-21 15:30:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-21 15:30:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2021-12-21 15:30:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2021-12-21 15:30:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 15:30:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-12-21 15:30:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-12-21 15:30:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-21 15:30:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-21 15:30:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 15:30:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:30:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 15:30:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:30:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:30:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-21 15:30:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-21 15:30:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-12-21 15:30:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-12-21 15:30:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-21 15:30:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-21 15:30:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2021-12-21 15:30:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2021-12-21 15:30:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:30:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 15:30:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 15:30:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-21 15:30:21,598 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-21 15:30:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:30:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:30:21,855 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:30:21,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:30:22,792 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:30:22,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:30:22,798 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:30:22,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:30:22 BoogieIcfgContainer [2021-12-21 15:30:22,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:30:22,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:30:22,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:30:22,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:30:22,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:30:19" (1/3) ... [2021-12-21 15:30:22,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb0b72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:30:22, skipping insertion in model container [2021-12-21 15:30:22,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:30:21" (2/3) ... [2021-12-21 15:30:22,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb0b72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:30:22, skipping insertion in model container [2021-12-21 15:30:22,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:30:22" (3/3) ... [2021-12-21 15:30:22,809 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-12-21 15:30:22,816 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:30:22,816 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 15:30:22,858 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:30:22,868 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 15:30:22,868 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 15:30:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-21 15:30:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 15:30:22,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:22,906 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:22,906 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:22,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2021-12-21 15:30:22,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089531139] [2021-12-21 15:30:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:22,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:23,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:23,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089531139] [2021-12-21 15:30:23,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089531139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:23,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:23,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:30:23,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009912701] [2021-12-21 15:30:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:23,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 15:30:23,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 15:30:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 15:30:23,506 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:23,535 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2021-12-21 15:30:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 15:30:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-21 15:30:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:23,548 INFO L225 Difference]: With dead ends: 193 [2021-12-21 15:30:23,549 INFO L226 Difference]: Without dead ends: 93 [2021-12-21 15:30:23,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 15:30:23,557 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:23,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:30:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-21 15:30:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-21 15:30:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-21 15:30:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-12-21 15:30:23,620 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2021-12-21 15:30:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:23,622 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-12-21 15:30:23,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-12-21 15:30:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 15:30:23,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:23,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:23,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:30:23,627 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2021-12-21 15:30:23,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:23,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979968019] [2021-12-21 15:30:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:23,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:23,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979968019] [2021-12-21 15:30:23,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979968019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:23,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:23,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 15:30:23,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728796033] [2021-12-21 15:30:23,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:23,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:30:23,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:30:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 15:30:23,917 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:24,001 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2021-12-21 15:30:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:30:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-21 15:30:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:24,007 INFO L225 Difference]: With dead ends: 147 [2021-12-21 15:30:24,007 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 15:30:24,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:30:24,012 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:24,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:30:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 15:30:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2021-12-21 15:30:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-21 15:30:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-12-21 15:30:24,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2021-12-21 15:30:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:24,036 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-12-21 15:30:24,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-12-21 15:30:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 15:30:24,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:24,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:24,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:30:24,037 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2021-12-21 15:30:24,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:24,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507724741] [2021-12-21 15:30:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:24,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:24,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507724741] [2021-12-21 15:30:24,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507724741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:24,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:24,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:30:24,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423572160] [2021-12-21 15:30:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:24,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:30:24,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:30:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:30:24,307 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:24,374 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2021-12-21 15:30:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:30:24,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-21 15:30:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:24,376 INFO L225 Difference]: With dead ends: 134 [2021-12-21 15:30:24,376 INFO L226 Difference]: Without dead ends: 96 [2021-12-21 15:30:24,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:30:24,377 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:24,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:30:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-21 15:30:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-21 15:30:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-21 15:30:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2021-12-21 15:30:24,386 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2021-12-21 15:30:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:24,386 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2021-12-21 15:30:24,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2021-12-21 15:30:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 15:30:24,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:24,388 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:24,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:30:24,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:24,389 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2021-12-21 15:30:24,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:24,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107746385] [2021-12-21 15:30:24,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:24,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:24,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107746385] [2021-12-21 15:30:24,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107746385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:24,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:24,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 15:30:24,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259252330] [2021-12-21 15:30:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:24,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:30:24,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:30:24,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 15:30:24,561 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:24,585 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2021-12-21 15:30:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:30:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-21 15:30:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:24,587 INFO L225 Difference]: With dead ends: 141 [2021-12-21 15:30:24,587 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 15:30:24,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:30:24,589 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:24,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:30:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 15:30:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2021-12-21 15:30:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-21 15:30:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-12-21 15:30:24,597 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2021-12-21 15:30:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:24,598 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-12-21 15:30:24,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-12-21 15:30:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 15:30:24,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:24,599 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:24,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:30:24,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2021-12-21 15:30:24,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:24,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737774209] [2021-12-21 15:30:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:24,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:24,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:24,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737774209] [2021-12-21 15:30:24,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737774209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:24,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:24,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:30:24,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633946324] [2021-12-21 15:30:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:24,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:30:24,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:30:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:24,841 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:24,898 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2021-12-21 15:30:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:30:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-21 15:30:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:24,901 INFO L225 Difference]: With dead ends: 110 [2021-12-21 15:30:24,901 INFO L226 Difference]: Without dead ends: 108 [2021-12-21 15:30:24,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:24,902 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:24,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 733 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:30:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-21 15:30:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-12-21 15:30:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-12-21 15:30:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-12-21 15:30:24,911 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2021-12-21 15:30:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:24,912 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-12-21 15:30:24,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-12-21 15:30:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 15:30:24,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:24,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:24,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:30:24,914 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2021-12-21 15:30:24,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:24,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105445212] [2021-12-21 15:30:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:24,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:25,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:25,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105445212] [2021-12-21 15:30:25,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105445212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:25,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:25,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:30:25,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533991425] [2021-12-21 15:30:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:25,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:30:25,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:30:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:25,220 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:25,493 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2021-12-21 15:30:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:30:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-21 15:30:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:25,495 INFO L225 Difference]: With dead ends: 184 [2021-12-21 15:30:25,495 INFO L226 Difference]: Without dead ends: 143 [2021-12-21 15:30:25,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:25,497 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:25,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 634 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-21 15:30:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2021-12-21 15:30:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.186046511627907) internal successors, (102), 89 states have internal predecessors, (102), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-21 15:30:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2021-12-21 15:30:25,518 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2021-12-21 15:30:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:25,519 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2021-12-21 15:30:25,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2021-12-21 15:30:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 15:30:25,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:25,525 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:25,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:30:25,525 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2021-12-21 15:30:25,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:25,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419638573] [2021-12-21 15:30:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:25,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:25,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419638573] [2021-12-21 15:30:25,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419638573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:25,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:25,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:30:25,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206991864] [2021-12-21 15:30:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:25,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:30:25,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:30:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:25,784 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:26,028 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2021-12-21 15:30:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:30:26,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-21 15:30:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:26,030 INFO L225 Difference]: With dead ends: 210 [2021-12-21 15:30:26,030 INFO L226 Difference]: Without dead ends: 155 [2021-12-21 15:30:26,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:30:26,031 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:26,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 623 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-21 15:30:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2021-12-21 15:30:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-21 15:30:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2021-12-21 15:30:26,038 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2021-12-21 15:30:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:26,039 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2021-12-21 15:30:26,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2021-12-21 15:30:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 15:30:26,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:26,040 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:26,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:30:26,041 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2021-12-21 15:30:26,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:26,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510480589] [2021-12-21 15:30:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:26,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:26,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:26,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510480589] [2021-12-21 15:30:26,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510480589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:26,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:26,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 15:30:26,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544926163] [2021-12-21 15:30:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:26,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 15:30:26,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 15:30:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:30:26,576 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 15:30:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:27,084 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2021-12-21 15:30:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:30:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2021-12-21 15:30:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:27,087 INFO L225 Difference]: With dead ends: 212 [2021-12-21 15:30:27,087 INFO L226 Difference]: Without dead ends: 155 [2021-12-21 15:30:27,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-12-21 15:30:27,088 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 237 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:27,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 578 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:30:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-21 15:30:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2021-12-21 15:30:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.21) internal successors, (121), 105 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-21 15:30:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-12-21 15:30:27,101 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2021-12-21 15:30:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:27,101 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-12-21 15:30:27,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 15:30:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-12-21 15:30:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 15:30:27,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:27,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:27,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:30:27,103 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2021-12-21 15:30:27,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057838380] [2021-12-21 15:30:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:27,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:27,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:27,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057838380] [2021-12-21 15:30:27,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057838380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:27,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:27,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 15:30:27,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714571064] [2021-12-21 15:30:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:27,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:30:27,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:30:27,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:30:27,305 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:27,406 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2021-12-21 15:30:27,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:30:27,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-21 15:30:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:27,408 INFO L225 Difference]: With dead ends: 225 [2021-12-21 15:30:27,408 INFO L226 Difference]: Without dead ends: 156 [2021-12-21 15:30:27,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:30:27,409 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:27,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 340 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:30:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-21 15:30:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2021-12-21 15:30:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-21 15:30:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2021-12-21 15:30:27,419 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2021-12-21 15:30:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:27,419 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2021-12-21 15:30:27,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2021-12-21 15:30:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-21 15:30:27,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:27,420 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:27,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:30:27,421 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2021-12-21 15:30:27,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:27,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769280846] [2021-12-21 15:30:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:27,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:27,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:27,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769280846] [2021-12-21 15:30:27,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769280846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:27,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:27,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:30:27,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705235625] [2021-12-21 15:30:27,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:27,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:30:27,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:30:27,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:27,651 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:27,763 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2021-12-21 15:30:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:30:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-21 15:30:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:27,766 INFO L225 Difference]: With dead ends: 164 [2021-12-21 15:30:27,766 INFO L226 Difference]: Without dead ends: 162 [2021-12-21 15:30:27,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-21 15:30:27,768 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:27,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 934 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:30:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-21 15:30:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-12-21 15:30:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2021-12-21 15:30:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2021-12-21 15:30:27,778 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2021-12-21 15:30:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:27,778 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2021-12-21 15:30:27,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 15:30:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2021-12-21 15:30:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-21 15:30:27,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:27,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:27,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:30:27,780 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2021-12-21 15:30:27,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:27,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269737019] [2021-12-21 15:30:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:27,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:27,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269737019] [2021-12-21 15:30:27,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269737019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:27,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:27,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:30:27,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667489551] [2021-12-21 15:30:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:27,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:30:27,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:30:27,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:30:27,994 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:28,205 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2021-12-21 15:30:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:30:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-21 15:30:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:28,207 INFO L225 Difference]: With dead ends: 250 [2021-12-21 15:30:28,207 INFO L226 Difference]: Without dead ends: 172 [2021-12-21 15:30:28,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:30:28,208 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:28,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 459 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-21 15:30:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2021-12-21 15:30:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2021-12-21 15:30:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2021-12-21 15:30:28,219 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2021-12-21 15:30:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:28,219 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2021-12-21 15:30:28,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 15:30:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2021-12-21 15:30:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-21 15:30:28,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:28,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:28,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:30:28,221 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2021-12-21 15:30:28,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:28,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657896728] [2021-12-21 15:30:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:28,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 15:30:28,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:28,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657896728] [2021-12-21 15:30:28,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657896728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:28,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:28,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:30:28,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211718844] [2021-12-21 15:30:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:28,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:30:28,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:30:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:28,469 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 15:30:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:28,532 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2021-12-21 15:30:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:30:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-12-21 15:30:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:28,534 INFO L225 Difference]: With dead ends: 151 [2021-12-21 15:30:28,534 INFO L226 Difference]: Without dead ends: 149 [2021-12-21 15:30:28,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:28,535 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:28,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 748 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:30:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-21 15:30:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-12-21 15:30:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-21 15:30:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2021-12-21 15:30:28,544 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2021-12-21 15:30:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:28,545 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2021-12-21 15:30:28,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 15:30:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2021-12-21 15:30:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 15:30:28,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:28,546 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:28,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 15:30:28,546 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2021-12-21 15:30:28,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364494022] [2021-12-21 15:30:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:28,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 15:30:28,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364494022] [2021-12-21 15:30:28,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364494022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:28,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:28,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:30:28,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501662469] [2021-12-21 15:30:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:28,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:30:28,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:30:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:28,828 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:29,100 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2021-12-21 15:30:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:30:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-21 15:30:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:29,102 INFO L225 Difference]: With dead ends: 191 [2021-12-21 15:30:29,102 INFO L226 Difference]: Without dead ends: 178 [2021-12-21 15:30:29,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:30:29,103 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 130 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:29,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 611 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-21 15:30:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2021-12-21 15:30:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-21 15:30:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2021-12-21 15:30:29,130 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2021-12-21 15:30:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:29,130 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2021-12-21 15:30:29,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2021-12-21 15:30:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 15:30:29,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:29,132 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:29,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 15:30:29,132 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2021-12-21 15:30:29,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:29,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172830917] [2021-12-21 15:30:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:29,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 15:30:29,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:29,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172830917] [2021-12-21 15:30:29,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172830917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:29,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:29,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:30:29,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611066902] [2021-12-21 15:30:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:29,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:30:29,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:30:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:29,424 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:29,677 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2021-12-21 15:30:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:30:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-21 15:30:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:29,679 INFO L225 Difference]: With dead ends: 204 [2021-12-21 15:30:29,679 INFO L226 Difference]: Without dead ends: 191 [2021-12-21 15:30:29,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:30:29,680 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:29,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 762 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-21 15:30:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2021-12-21 15:30:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-21 15:30:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2021-12-21 15:30:29,691 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2021-12-21 15:30:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:29,691 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2021-12-21 15:30:29,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2021-12-21 15:30:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 15:30:29,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:29,692 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:29,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 15:30:29,693 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2021-12-21 15:30:29,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:29,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226934840] [2021-12-21 15:30:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:29,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 15:30:30,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:30,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226934840] [2021-12-21 15:30:30,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226934840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:30:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258222320] [2021-12-21 15:30:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:30,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:30:30,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:30:30,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:30:30,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 15:30:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:30,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-21 15:30:30,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:30:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 15:30:31,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:30:32,075 INFO L353 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-21 15:30:32,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-21 15:30:32,084 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-21 15:30:32,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-21 15:30:32,214 INFO L353 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-21 15:30:32,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-21 15:30:32,227 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-21 15:30:32,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-21 15:30:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 15:30:32,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258222320] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:30:32,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:30:32,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2021-12-21 15:30:32,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306825269] [2021-12-21 15:30:32,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:30:32,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-21 15:30:32,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-21 15:30:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2021-12-21 15:30:32,310 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-12-21 15:30:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:33,565 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2021-12-21 15:30:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 15:30:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2021-12-21 15:30:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:33,567 INFO L225 Difference]: With dead ends: 288 [2021-12-21 15:30:33,567 INFO L226 Difference]: Without dead ends: 234 [2021-12-21 15:30:33,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2021-12-21 15:30:33,569 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 382 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:33,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 1795 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 769 Invalid, 0 Unknown, 174 Unchecked, 0.6s Time] [2021-12-21 15:30:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-21 15:30:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2021-12-21 15:30:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 162 states have internal predecessors, (177), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2021-12-21 15:30:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-12-21 15:30:33,581 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 61 [2021-12-21 15:30:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:33,582 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-12-21 15:30:33,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-12-21 15:30:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-12-21 15:30:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-21 15:30:33,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:33,583 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:33,609 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-12-21 15:30:33,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-21 15:30:33,800 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2021-12-21 15:30:33,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:33,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091613336] [2021-12-21 15:30:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:33,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:30:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 15:30:34,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:34,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091613336] [2021-12-21 15:30:34,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091613336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:34,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:34,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:30:34,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138176490] [2021-12-21 15:30:34,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:34,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:30:34,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:30:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:30:34,208 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-21 15:30:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:34,410 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2021-12-21 15:30:34,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:30:34,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2021-12-21 15:30:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:34,412 INFO L225 Difference]: With dead ends: 225 [2021-12-21 15:30:34,412 INFO L226 Difference]: Without dead ends: 223 [2021-12-21 15:30:34,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:30:34,413 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:34,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 596 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:30:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-21 15:30:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2021-12-21 15:30:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.15) internal successors, (184), 169 states have internal predecessors, (184), 34 states have call successors, (34), 18 states have call predecessors, (34), 24 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2021-12-21 15:30:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2021-12-21 15:30:34,430 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 63 [2021-12-21 15:30:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:34,430 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2021-12-21 15:30:34,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-21 15:30:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2021-12-21 15:30:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-21 15:30:34,431 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:34,432 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:34,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 15:30:34,432 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2021-12-21 15:30:34,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:34,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541920905] [2021-12-21 15:30:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:34,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 15:30:34,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541920905] [2021-12-21 15:30:34,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541920905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:34,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:34,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:30:34,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542696502] [2021-12-21 15:30:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:34,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:30:34,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:30:34,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:34,657 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 15:30:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:34,766 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2021-12-21 15:30:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:30:34,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-12-21 15:30:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:34,768 INFO L225 Difference]: With dead ends: 247 [2021-12-21 15:30:34,768 INFO L226 Difference]: Without dead ends: 245 [2021-12-21 15:30:34,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-21 15:30:34,769 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:34,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 955 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:30:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-21 15:30:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2021-12-21 15:30:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 177 states have internal predecessors, (191), 34 states have call successors, (34), 18 states have call predecessors, (34), 25 states have return successors, (47), 31 states have call predecessors, (47), 32 states have call successors, (47) [2021-12-21 15:30:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-12-21 15:30:34,782 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 63 [2021-12-21 15:30:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:34,783 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-12-21 15:30:34,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 15:30:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-12-21 15:30:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-21 15:30:34,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:34,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:34,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 15:30:34,784 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2021-12-21 15:30:34,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:34,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814626168] [2021-12-21 15:30:34,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:34,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 15:30:35,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814626168] [2021-12-21 15:30:35,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814626168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:35,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:35,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:30:35,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569116370] [2021-12-21 15:30:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:35,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:30:35,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:30:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:30:35,075 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:35,291 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2021-12-21 15:30:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:30:35,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2021-12-21 15:30:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:35,293 INFO L225 Difference]: With dead ends: 269 [2021-12-21 15:30:35,293 INFO L226 Difference]: Without dead ends: 231 [2021-12-21 15:30:35,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:30:35,294 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:35,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 612 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-21 15:30:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2021-12-21 15:30:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 165 states have internal predecessors, (180), 33 states have call successors, (33), 18 states have call predecessors, (33), 23 states have return successors, (43), 30 states have call predecessors, (43), 31 states have call successors, (43) [2021-12-21 15:30:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2021-12-21 15:30:35,306 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 63 [2021-12-21 15:30:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:35,307 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2021-12-21 15:30:35,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2021-12-21 15:30:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-21 15:30:35,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:35,308 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:35,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 15:30:35,309 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2021-12-21 15:30:35,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:35,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647100170] [2021-12-21 15:30:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:35,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:30:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:30:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 15:30:35,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647100170] [2021-12-21 15:30:35,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647100170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:35,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:35,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:30:35,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580972072] [2021-12-21 15:30:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:35,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:30:35,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:30:35,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:35,549 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-21 15:30:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:35,696 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2021-12-21 15:30:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:30:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2021-12-21 15:30:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:35,699 INFO L225 Difference]: With dead ends: 228 [2021-12-21 15:30:35,699 INFO L226 Difference]: Without dead ends: 224 [2021-12-21 15:30:35,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:30:35,700 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:35,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 687 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:30:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-21 15:30:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2021-12-21 15:30:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 163 states have (on average 1.1349693251533743) internal successors, (185), 170 states have internal predecessors, (185), 34 states have call successors, (34), 20 states have call predecessors, (34), 24 states have return successors, (44), 31 states have call predecessors, (44), 32 states have call successors, (44) [2021-12-21 15:30:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2021-12-21 15:30:35,714 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 69 [2021-12-21 15:30:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:35,714 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2021-12-21 15:30:35,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-21 15:30:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2021-12-21 15:30:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-21 15:30:35,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:35,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:35,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 15:30:35,717 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:35,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2021-12-21 15:30:35,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:35,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229758370] [2021-12-21 15:30:35,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:35,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 15:30:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 15:30:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 15:30:36,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:36,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229758370] [2021-12-21 15:30:36,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229758370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:36,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:36,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-21 15:30:36,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217682139] [2021-12-21 15:30:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:36,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 15:30:36,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 15:30:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 15:30:36,205 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:36,796 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2021-12-21 15:30:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:30:36,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2021-12-21 15:30:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:36,798 INFO L225 Difference]: With dead ends: 280 [2021-12-21 15:30:36,798 INFO L226 Difference]: Without dead ends: 254 [2021-12-21 15:30:36,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-12-21 15:30:36,800 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:36,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 579 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:30:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-21 15:30:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2021-12-21 15:30:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 166 states have (on average 1.1325301204819278) internal successors, (188), 173 states have internal predecessors, (188), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2021-12-21 15:30:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2021-12-21 15:30:36,822 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 67 [2021-12-21 15:30:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:36,823 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2021-12-21 15:30:36,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 15:30:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2021-12-21 15:30:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-21 15:30:36,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:36,825 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:36,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 15:30:36,825 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2021-12-21 15:30:36,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:36,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886061223] [2021-12-21 15:30:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:36,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:30:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:30:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:30:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:30:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-21 15:30:37,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:37,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886061223] [2021-12-21 15:30:37,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886061223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:37,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:37,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:30:37,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122792954] [2021-12-21 15:30:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:37,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:30:37,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:30:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:30:37,330 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-21 15:30:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:37,703 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2021-12-21 15:30:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:30:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2021-12-21 15:30:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:37,705 INFO L225 Difference]: With dead ends: 235 [2021-12-21 15:30:37,705 INFO L226 Difference]: Without dead ends: 154 [2021-12-21 15:30:37,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-12-21 15:30:37,706 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 158 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:37,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 674 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-21 15:30:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2021-12-21 15:30:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.17) internal successors, (117), 105 states have internal predecessors, (117), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-12-21 15:30:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2021-12-21 15:30:37,714 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 75 [2021-12-21 15:30:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:37,714 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2021-12-21 15:30:37,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-21 15:30:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2021-12-21 15:30:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-21 15:30:37,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:37,716 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:37,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 15:30:37,716 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2021-12-21 15:30:37,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:37,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465467777] [2021-12-21 15:30:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:37,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 15:30:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 15:30:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 15:30:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:30:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 15:30:37,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:37,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465467777] [2021-12-21 15:30:37,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465467777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:37,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:37,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:30:37,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160490771] [2021-12-21 15:30:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:37,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:30:37,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:30:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:37,962 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-21 15:30:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:38,266 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2021-12-21 15:30:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:30:38,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2021-12-21 15:30:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:38,269 INFO L225 Difference]: With dead ends: 243 [2021-12-21 15:30:38,269 INFO L226 Difference]: Without dead ends: 153 [2021-12-21 15:30:38,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-21 15:30:38,270 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:38,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-21 15:30:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2021-12-21 15:30:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-21 15:30:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2021-12-21 15:30:38,278 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 79 [2021-12-21 15:30:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:38,278 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2021-12-21 15:30:38,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-21 15:30:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2021-12-21 15:30:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-21 15:30:38,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:38,282 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:38,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 15:30:38,282 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:38,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2021-12-21 15:30:38,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:38,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717389680] [2021-12-21 15:30:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:38,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 15:30:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 15:30:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 15:30:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:30:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 15:30:38,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:38,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717389680] [2021-12-21 15:30:38,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717389680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:38,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:38,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:30:38,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426741570] [2021-12-21 15:30:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:38,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:30:38,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:38,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:30:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:30:38,594 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-21 15:30:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:39,138 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2021-12-21 15:30:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 15:30:39,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-21 15:30:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:39,140 INFO L225 Difference]: With dead ends: 244 [2021-12-21 15:30:39,140 INFO L226 Difference]: Without dead ends: 177 [2021-12-21 15:30:39,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-12-21 15:30:39,141 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:39,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 462 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 15:30:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-21 15:30:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2021-12-21 15:30:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 115 states have internal predecessors, (128), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-21 15:30:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2021-12-21 15:30:39,151 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 85 [2021-12-21 15:30:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:39,151 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2021-12-21 15:30:39,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-21 15:30:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-12-21 15:30:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-21 15:30:39,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:39,153 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:39,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 15:30:39,153 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2021-12-21 15:30:39,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:39,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982672591] [2021-12-21 15:30:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:39,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 15:30:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 15:30:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 15:30:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:30:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 15:30:39,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:39,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982672591] [2021-12-21 15:30:39,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982672591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:39,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:39,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:30:39,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885068848] [2021-12-21 15:30:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:39,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:30:39,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:30:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:30:39,369 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-21 15:30:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:39,619 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2021-12-21 15:30:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:30:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-21 15:30:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:39,621 INFO L225 Difference]: With dead ends: 224 [2021-12-21 15:30:39,621 INFO L226 Difference]: Without dead ends: 156 [2021-12-21 15:30:39,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:39,622 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:39,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-21 15:30:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2021-12-21 15:30:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.146788990825688) internal successors, (125), 114 states have internal predecessors, (125), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-21 15:30:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2021-12-21 15:30:39,632 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 85 [2021-12-21 15:30:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:39,633 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2021-12-21 15:30:39,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-21 15:30:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2021-12-21 15:30:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-21 15:30:39,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:39,634 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:39,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 15:30:39,635 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2021-12-21 15:30:39,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:39,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421641458] [2021-12-21 15:30:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:39,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 15:30:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 15:30:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 15:30:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:30:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-21 15:30:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 15:30:39,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:39,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421641458] [2021-12-21 15:30:39,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421641458] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:39,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:39,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:30:39,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270103913] [2021-12-21 15:30:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:39,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:30:39,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:30:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:30:39,839 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-21 15:30:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:40,053 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2021-12-21 15:30:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:30:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2021-12-21 15:30:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:40,054 INFO L225 Difference]: With dead ends: 211 [2021-12-21 15:30:40,054 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 15:30:40,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:30:40,054 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:40,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:30:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 15:30:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-12-21 15:30:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-12-21 15:30:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-12-21 15:30:40,060 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2021-12-21 15:30:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:40,060 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-12-21 15:30:40,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-21 15:30:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2021-12-21 15:30:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-21 15:30:40,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:40,062 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:40,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-21 15:30:40,062 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:40,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2021-12-21 15:30:40,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:40,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713354826] [2021-12-21 15:30:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:40,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 15:30:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 15:30:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 15:30:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:30:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-21 15:30:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-21 15:30:40,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:40,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713354826] [2021-12-21 15:30:40,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713354826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:40,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:30:40,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-21 15:30:40,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604011564] [2021-12-21 15:30:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:40,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 15:30:40,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 15:30:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:30:40,612 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-21 15:30:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:41,078 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2021-12-21 15:30:41,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:30:41,079 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2021-12-21 15:30:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:41,080 INFO L225 Difference]: With dead ends: 152 [2021-12-21 15:30:41,080 INFO L226 Difference]: Without dead ends: 95 [2021-12-21 15:30:41,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-12-21 15:30:41,081 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 189 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:41,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 229 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:30:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-21 15:30:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-21 15:30:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-21 15:30:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-12-21 15:30:41,088 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2021-12-21 15:30:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:41,088 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-12-21 15:30:41,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-21 15:30:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-12-21 15:30:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-21 15:30:41,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:30:41,090 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:30:41,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-21 15:30:41,090 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:30:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:30:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2021-12-21 15:30:41,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:30:41,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123961736] [2021-12-21 15:30:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:41,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:30:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:30:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:30:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:30:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 15:30:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 15:30:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 15:30:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:30:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:30:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:30:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-21 15:30:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:30:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:30:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 15:30:41,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:30:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123961736] [2021-12-21 15:30:41,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123961736] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:30:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949017010] [2021-12-21 15:30:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:30:41,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:30:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:30:41,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:30:41,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 15:30:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:30:42,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 15:30:42,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:30:42,600 INFO L387 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 21 treesize of output 26 [2021-12-21 15:30:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-21 15:30:43,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:30:43,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949017010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:30:43,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:30:43,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 22 [2021-12-21 15:30:43,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416360310] [2021-12-21 15:30:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:30:43,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:30:43,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:30:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:30:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-12-21 15:30:43,197 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-21 15:30:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:30:43,280 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2021-12-21 15:30:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:30:43,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2021-12-21 15:30:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:30:43,281 INFO L225 Difference]: With dead ends: 95 [2021-12-21 15:30:43,281 INFO L226 Difference]: Without dead ends: 0 [2021-12-21 15:30:43,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-12-21 15:30:43,282 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:30:43,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 467 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-21 15:30:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-21 15:30:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-21 15:30:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:30:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-21 15:30:43,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2021-12-21 15:30:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:30:43,283 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-21 15:30:43,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-21 15:30:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-21 15:30:43,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-21 15:30:43,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 15:30:43,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 15:30:43,486 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,SelfDestructingSolverStorable26 [2021-12-21 15:30:43,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-21 15:30:45,808 INFO L854 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,808 INFO L854 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,808 INFO L858 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2021-12-21 15:30:45,808 INFO L854 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,808 INFO L858 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2021-12-21 15:30:45,808 INFO L858 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2021-12-21 15:30:45,808 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2021-12-21 15:30:45,808 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2021-12-21 15:30:45,808 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,808 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (< 0 (+ aws_mem_acquire_~mem~0.offset 1)) (<= aws_mem_acquire_~mem~0.base 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.offset 0) (< 0 (+ aws_mem_acquire_~mem~0.base 1))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L854 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,809 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,810 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-21 15:30:45,811 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-21 15:30:45,811 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-21 15:30:45,812 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-21 15:30:45,812 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-21 15:30:45,812 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-21 15:30:45,812 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-21 15:30:45,812 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-12-21 15:30:45,815 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-12-21 15:30:45,815 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-12-21 15:30:45,815 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2021-12-21 15:30:45,816 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2021-12-21 15:30:45,816 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2021-12-21 15:30:45,816 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2021-12-21 15:30:45,816 INFO L858 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2021-12-21 15:30:45,816 INFO L861 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2021-12-21 15:30:45,816 INFO L861 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2021-12-21 15:30:45,816 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2021-12-21 15:30:45,817 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-12-21 15:30:45,817 INFO L854 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-21 15:30:45,817 INFO L858 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2021-12-21 15:30:45,817 INFO L858 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-12-21 15:30:45,817 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-21 15:30:45,817 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-21 15:30:45,818 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-21 15:30:45,818 INFO L854 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse14) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse14))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616) 0)) .cse12 .cse13)))) [2021-12-21 15:30:45,818 INFO L861 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-12-21 15:30:45,818 INFO L858 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2021-12-21 15:30:45,818 INFO L854 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse10 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse2 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse7 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse17 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (select .cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse9 (+ 18446744073709551615 (* (div (+ (- 1) .cse9) 18446744073709551616) 18446744073709551616)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse17))))) [2021-12-21 15:30:45,819 INFO L858 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-12-21 15:30:45,819 INFO L858 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-12-21 15:30:45,819 INFO L854 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1| 0) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-12-21 15:30:45,819 INFO L858 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2021-12-21 15:30:45,819 INFO L858 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-12-21 15:30:45,819 INFO L858 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-12-21 15:30:45,820 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-21 15:30:45,820 INFO L854 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0) .cse10 .cse11 (not (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-12-21 15:30:45,820 INFO L854 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (let ((.cse2 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) (.cse3 (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1| 18446744073709551616))) (let ((.cse1 (* 18446744073709551616 .cse3)) (.cse0 (+ (* 18446744073709551616 .cse2) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1|))) (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (< .cse0 (+ .cse1 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 1)) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (<= .cse2 .cse3) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (<= (+ .cse1 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)))) [2021-12-21 15:30:45,820 INFO L854 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) [2021-12-21 15:30:45,820 INFO L858 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2021-12-21 15:30:45,821 INFO L854 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-12-21 15:30:45,821 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-12-21 15:30:45,821 INFO L858 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2021-12-21 15:30:45,821 INFO L858 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2021-12-21 15:30:45,821 INFO L858 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2021-12-21 15:30:45,822 INFO L854 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (not (= (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616) 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-12-21 15:30:45,822 INFO L854 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-12-21 15:30:45,823 INFO L854 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1| 1) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-21 15:30:45,824 INFO L858 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2021-12-21 15:30:45,824 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-21 15:30:45,824 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-21 15:30:45,824 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-21 15:30:45,824 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-21 15:30:45,824 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-21 15:30:45,825 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-21 15:30:45,828 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] [2021-12-21 15:30:45,829 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:30:45,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:45,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:45,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:45,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:45,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:45,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:45,849 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:45,850 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:45,850 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:45,851 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:45,851 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:45,851 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:45,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:30:45 BoogieIcfgContainer [2021-12-21 15:30:45,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:30:45,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:30:45,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:30:45,855 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:30:45,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:30:22" (3/4) ... [2021-12-21 15:30:45,858 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-21 15:30:45,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2021-12-21 15:30:45,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2021-12-21 15:30:45,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-21 15:30:45,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2021-12-21 15:30:45,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-21 15:30:45,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-21 15:30:45,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-21 15:30:45,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-21 15:30:45,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-12-21 15:30:45,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-21 15:30:45,875 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2021-12-21 15:30:45,876 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2021-12-21 15:30:45,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-21 15:30:45,878 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-21 15:30:45,879 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-21 15:30:45,880 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-21 15:30:45,881 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-21 15:30:45,882 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-21 15:30:45,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + (-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616 * 18446744073709551616) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2021-12-21 15:30:46,685 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:30:46,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:30:46,686 INFO L158 Benchmark]: Toolchain (without parser) took 27449.61ms. Allocated memory was 107.0MB in the beginning and 448.8MB in the end (delta: 341.8MB). Free memory was 66.0MB in the beginning and 222.3MB in the end (delta: -156.2MB). Peak memory consumption was 298.1MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,686 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:30:46,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2037.35ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 65.8MB in the beginning and 51.0MB in the end (delta: 14.8MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 183.92ms. Allocated memory is still 130.0MB. Free memory was 51.0MB in the beginning and 75.3MB in the end (delta: -24.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,687 INFO L158 Benchmark]: Boogie Preprocessor took 68.65ms. Allocated memory is still 130.0MB. Free memory was 75.3MB in the beginning and 69.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,687 INFO L158 Benchmark]: RCFGBuilder took 1271.67ms. Allocated memory was 130.0MB in the beginning and 190.8MB in the end (delta: 60.8MB). Free memory was 69.0MB in the beginning and 95.9MB in the end (delta: -26.9MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,688 INFO L158 Benchmark]: TraceAbstraction took 23051.62ms. Allocated memory was 190.8MB in the beginning and 448.8MB in the end (delta: 257.9MB). Free memory was 95.9MB in the beginning and 255.7MB in the end (delta: -159.8MB). Peak memory consumption was 235.5MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,688 INFO L158 Benchmark]: Witness Printer took 831.14ms. Allocated memory is still 448.8MB. Free memory was 255.7MB in the beginning and 222.3MB in the end (delta: 33.5MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2021-12-21 15:30:46,689 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 79.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2037.35ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 65.8MB in the beginning and 51.0MB in the end (delta: 14.8MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 183.92ms. Allocated memory is still 130.0MB. Free memory was 51.0MB in the beginning and 75.3MB in the end (delta: -24.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.65ms. Allocated memory is still 130.0MB. Free memory was 75.3MB in the beginning and 69.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1271.67ms. Allocated memory was 130.0MB in the beginning and 190.8MB in the end (delta: 60.8MB). Free memory was 69.0MB in the beginning and 95.9MB in the end (delta: -26.9MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23051.62ms. Allocated memory was 190.8MB in the beginning and 448.8MB in the end (delta: 257.9MB). Free memory was 95.9MB in the beginning and 255.7MB in the end (delta: -159.8MB). Peak memory consumption was 235.5MB. Max. memory is 16.1GB. * Witness Printer took 831.14ms. Allocated memory is still 448.8MB. Free memory was 255.7MB in the beginning and 222.3MB in the end (delta: 33.5MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2165 mSDsluCounter, 15556 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 208 IncrementalHoareTripleChecker+Unchecked, 12735 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4834 IncrementalHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 2821 mSDtfsCounter, 4834 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 614 SyntacticMatches, 12 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=17, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 367 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 185 PreInvPairs, 212 NumberOfFragments, 1298 HoareAnnotationTreeSize, 185 FomulaSimplifications, 267 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 32 FomulaSimplificationsInter, 104207 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1807 ConstructedInterpolants, 55 QuantifiedInterpolants, 9902 SizeOfPredicates, 37 NumberOfNonLiveVariables, 5076 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 542/575 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7110]: Loop Invariant [2021-12-21 15:30:46,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:46,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:46,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:46,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:46,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:30:46,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:46,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:30:46,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + (-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616 * 18446744073709551616) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-21 15:30:46,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE