./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 87fd6ee1 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 /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f1aa9a20ea1f61d81b9e5d760323957ed608e60 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-87fd6ee [2020-12-04 18:15:52,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 18:15:52,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 18:15:52,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 18:15:52,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 18:15:52,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 18:15:52,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 18:15:52,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 18:15:52,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 18:15:52,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 18:15:52,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 18:15:52,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 18:15:52,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 18:15:52,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 18:15:52,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 18:15:52,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 18:15:52,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 18:15:52,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 18:15:52,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 18:15:52,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 18:15:52,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 18:15:52,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 18:15:52,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 18:15:52,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 18:15:52,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 18:15:52,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 18:15:52,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 18:15:52,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 18:15:52,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 18:15:52,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 18:15:52,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 18:15:52,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 18:15:52,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 18:15:52,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 18:15:52,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 18:15:52,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 18:15:52,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 18:15:52,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 18:15:52,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 18:15:52,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 18:15:52,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 18:15:52,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-04 18:15:52,834 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 18:15:52,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 18:15:52,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 18:15:52,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 18:15:52,840 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 18:15:52,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 18:15:52,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 18:15:52,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 18:15:52,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 18:15:52,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 18:15:52,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 18:15:52,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 18:15:52,844 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 18:15:52,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 18:15:52,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 18:15:52,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 18:15:52,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 18:15:52,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:15:52,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 18:15:52,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 18:15:52,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 18:15:52,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 18:15:52,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 18:15:52,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 18:15:52,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 18:15:52,847 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 -> 2f1aa9a20ea1f61d81b9e5d760323957ed608e60 [2020-12-04 18:15:53,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 18:15:53,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 18:15:53,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 18:15:53,321 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 18:15:53,322 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 18:15:53,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i [2020-12-04 18:15:53,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab5b9960/056227549bf74fa2b21dd530306ad40a/FLAGd31dd45ec [2020-12-04 18:15:54,521 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 18:15:54,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i [2020-12-04 18:15:54,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab5b9960/056227549bf74fa2b21dd530306ad40a/FLAGd31dd45ec [2020-12-04 18:15:54,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab5b9960/056227549bf74fa2b21dd530306ad40a [2020-12-04 18:15:54,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 18:15:54,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 18:15:54,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 18:15:54,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 18:15:54,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 18:15:54,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:15:54" (1/1) ... [2020-12-04 18:15:54,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa0d398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:54, skipping insertion in model container [2020-12-04 18:15:54,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:15:54" (1/1) ... [2020-12-04 18:15:54,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 18:15:55,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-04 18:15:55,428 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2020-12-04 18:15:55,440 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2020-12-04 18:15:55,471 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:15:55,481 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:15:56,499 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,500 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,500 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,501 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,502 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,518 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,519 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,521 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,522 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:56,961 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:15:56,963 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:15:56,964 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:15:56,966 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:15:56,968 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:15:56,969 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:15:56,970 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:15:56,971 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:15:56,972 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:15:56,972 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:15:57,211 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:15:57,333 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,334 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:15:57,499 INFO L203 MainTranslator]: Completed pre-run [2020-12-04 18:15:57,517 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2020-12-04 18:15:57,518 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2020-12-04 18:15:57,520 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:15:57,522 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:15:57,585 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,587 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,588 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,588 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,591 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,610 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,611 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,616 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,619 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,720 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:15:57,721 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:15:57,722 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:15:57,723 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:15:57,727 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:15:57,728 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:15:57,729 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:15:57,729 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:15:57,730 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:15:57,730 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:15:57,772 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:15:57,908 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,909 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:15:57,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:15:59,031 INFO L208 MainTranslator]: Completed translation [2020-12-04 18:15:59,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59 WrapperNode [2020-12-04 18:15:59,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 18:15:59,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 18:15:59,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 18:15:59,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 18:15:59,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 18:15:59,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 18:15:59,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 18:15:59,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 18:15:59,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... [2020-12-04 18:15:59,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 18:15:59,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 18:15:59,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 18:15:59,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 18:15:59,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:15:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-04 18:15:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-04 18:15:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-04 18:15:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-04 18:15:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 18:15:59,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 18:15:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 18:15:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-04 18:15:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-04 18:15:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-04 18:15:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 18:16:09,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 18:16:09,319 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2020-12-04 18:16:09,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:16:09 BoogieIcfgContainer [2020-12-04 18:16:09,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 18:16:09,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 18:16:09,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 18:16:09,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 18:16:09,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 06:15:54" (1/3) ... [2020-12-04 18:16:09,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d05b84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:16:09, skipping insertion in model container [2020-12-04 18:16:09,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:15:59" (2/3) ... [2020-12-04 18:16:09,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d05b84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:16:09, skipping insertion in model container [2020-12-04 18:16:09,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:16:09" (3/3) ... [2020-12-04 18:16:09,334 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2020-12-04 18:16:09,356 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 18:16:09,363 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-04 18:16:09,379 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-04 18:16:09,413 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 18:16:09,413 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 18:16:09,413 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 18:16:09,413 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 18:16:09,414 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 18:16:09,414 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 18:16:09,414 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 18:16:09,414 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 18:16:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-12-04 18:16:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-04 18:16:09,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:09,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:09,447 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2020-12-04 18:16:09,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:09,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712516024] [2020-12-04 18:16:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:10,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712516024] [2020-12-04 18:16:10,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:10,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 18:16:10,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045566123] [2020-12-04 18:16:10,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 18:16:10,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:10,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 18:16:10,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:16:10,432 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2020-12-04 18:16:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:10,463 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2020-12-04 18:16:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 18:16:10,469 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-12-04 18:16:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:10,490 INFO L225 Difference]: With dead ends: 153 [2020-12-04 18:16:10,490 INFO L226 Difference]: Without dead ends: 71 [2020-12-04 18:16:10,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:16:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-04 18:16:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-04 18:16:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-04 18:16:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2020-12-04 18:16:10,548 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 14 [2020-12-04 18:16:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:10,549 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2020-12-04 18:16:10,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 18:16:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2020-12-04 18:16:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-04 18:16:10,550 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:10,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:10,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 18:16:10,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2020-12-04 18:16:10,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:10,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2288800] [2020-12-04 18:16:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:10,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2288800] [2020-12-04 18:16:10,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:10,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:16:10,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645017918] [2020-12-04 18:16:10,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:16:10,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:16:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:16:10,986 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 4 states. [2020-12-04 18:16:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:11,092 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2020-12-04 18:16:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:16:11,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-04 18:16:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:11,096 INFO L225 Difference]: With dead ends: 120 [2020-12-04 18:16:11,098 INFO L226 Difference]: Without dead ends: 71 [2020-12-04 18:16:11,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:16:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-04 18:16:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-04 18:16:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-04 18:16:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2020-12-04 18:16:11,120 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2020-12-04 18:16:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:11,120 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2020-12-04 18:16:11,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:16:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2020-12-04 18:16:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-04 18:16:11,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:11,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:11,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 18:16:11,124 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2020-12-04 18:16:11,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:11,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393523415] [2020-12-04 18:16:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:11,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393523415] [2020-12-04 18:16:11,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:11,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:16:11,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508569772] [2020-12-04 18:16:11,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:16:11,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:11,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:16:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:16:11,456 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 4 states. [2020-12-04 18:16:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:11,588 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2020-12-04 18:16:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:16:11,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-04 18:16:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:11,595 INFO L225 Difference]: With dead ends: 173 [2020-12-04 18:16:11,596 INFO L226 Difference]: Without dead ends: 115 [2020-12-04 18:16:11,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:16:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-04 18:16:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2020-12-04 18:16:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-04 18:16:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2020-12-04 18:16:11,622 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 20 [2020-12-04 18:16:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:11,623 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2020-12-04 18:16:11,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:16:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2020-12-04 18:16:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-04 18:16:11,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:11,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:11,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-04 18:16:11,628 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2020-12-04 18:16:11,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:11,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850468398] [2020-12-04 18:16:11,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:11,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850468398] [2020-12-04 18:16:11,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:11,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:16:11,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598362684] [2020-12-04 18:16:11,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:16:11,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:16:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:16:11,940 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 4 states. [2020-12-04 18:16:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:12,053 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2020-12-04 18:16:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:16:12,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-04 18:16:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:12,055 INFO L225 Difference]: With dead ends: 147 [2020-12-04 18:16:12,055 INFO L226 Difference]: Without dead ends: 95 [2020-12-04 18:16:12,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:16:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-04 18:16:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2020-12-04 18:16:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-04 18:16:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2020-12-04 18:16:12,081 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2020-12-04 18:16:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:12,082 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2020-12-04 18:16:12,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:16:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2020-12-04 18:16:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-04 18:16:12,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:12,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:12,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-04 18:16:12,084 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:12,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2020-12-04 18:16:12,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:12,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065507067] [2020-12-04 18:16:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:12,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065507067] [2020-12-04 18:16:12,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:12,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:16:12,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120821126] [2020-12-04 18:16:12,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:16:12,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:16:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:16:12,883 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 6 states. [2020-12-04 18:16:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:13,249 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2020-12-04 18:16:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:16:13,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-04 18:16:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:13,253 INFO L225 Difference]: With dead ends: 139 [2020-12-04 18:16:13,253 INFO L226 Difference]: Without dead ends: 135 [2020-12-04 18:16:13,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:16:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-04 18:16:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2020-12-04 18:16:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-04 18:16:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2020-12-04 18:16:13,273 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2020-12-04 18:16:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:13,277 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2020-12-04 18:16:13,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:16:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2020-12-04 18:16:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-04 18:16:13,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:13,278 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:13,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-04 18:16:13,280 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:13,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:13,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2020-12-04 18:16:13,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:13,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697446428] [2020-12-04 18:16:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:17,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697446428] [2020-12-04 18:16:17,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:17,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:16:17,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448446437] [2020-12-04 18:16:17,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:16:17,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:17,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:16:17,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:16:17,213 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 7 states. [2020-12-04 18:16:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:19,740 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2020-12-04 18:16:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 18:16:19,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-04 18:16:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:19,742 INFO L225 Difference]: With dead ends: 179 [2020-12-04 18:16:19,742 INFO L226 Difference]: Without dead ends: 116 [2020-12-04 18:16:19,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:16:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-04 18:16:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2020-12-04 18:16:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-04 18:16:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2020-12-04 18:16:19,750 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 24 [2020-12-04 18:16:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:19,751 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2020-12-04 18:16:19,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:16:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2020-12-04 18:16:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-04 18:16:19,752 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:19,753 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:19,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-04 18:16:19,753 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 561819178, now seen corresponding path program 1 times [2020-12-04 18:16:19,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:19,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038622982] [2020-12-04 18:16:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:20,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038622982] [2020-12-04 18:16:20,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:20,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:16:20,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392812398] [2020-12-04 18:16:20,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:16:20,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:20,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:16:20,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:16:20,337 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 7 states. [2020-12-04 18:16:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:23,252 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2020-12-04 18:16:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 18:16:23,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-04 18:16:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:23,255 INFO L225 Difference]: With dead ends: 232 [2020-12-04 18:16:23,256 INFO L226 Difference]: Without dead ends: 173 [2020-12-04 18:16:23,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:16:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-04 18:16:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 101. [2020-12-04 18:16:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-04 18:16:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2020-12-04 18:16:23,264 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 24 [2020-12-04 18:16:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:23,265 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2020-12-04 18:16:23,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:16:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2020-12-04 18:16:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-04 18:16:23,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:23,267 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:23,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-04 18:16:23,267 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1241877548, now seen corresponding path program 1 times [2020-12-04 18:16:23,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:23,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454604266] [2020-12-04 18:16:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:23,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454604266] [2020-12-04 18:16:23,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:23,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:16:23,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000942200] [2020-12-04 18:16:23,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:16:23,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:16:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:16:23,805 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2020-12-04 18:16:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:26,220 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2020-12-04 18:16:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:16:26,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-04 18:16:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:26,223 INFO L225 Difference]: With dead ends: 221 [2020-12-04 18:16:26,223 INFO L226 Difference]: Without dead ends: 158 [2020-12-04 18:16:26,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:16:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-04 18:16:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2020-12-04 18:16:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-04 18:16:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2020-12-04 18:16:26,235 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 24 [2020-12-04 18:16:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:26,235 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2020-12-04 18:16:26,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:16:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2020-12-04 18:16:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-04 18:16:26,242 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:26,242 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:26,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-04 18:16:26,243 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:26,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2020-12-04 18:16:26,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:26,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135747452] [2020-12-04 18:16:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:29,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135747452] [2020-12-04 18:16:29,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:29,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:16:29,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046055379] [2020-12-04 18:16:29,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:16:29,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:16:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:16:29,653 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 7 states. [2020-12-04 18:16:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:32,322 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2020-12-04 18:16:32,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 18:16:32,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-04 18:16:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:32,324 INFO L225 Difference]: With dead ends: 193 [2020-12-04 18:16:32,324 INFO L226 Difference]: Without dead ends: 124 [2020-12-04 18:16:32,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:16:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-04 18:16:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2020-12-04 18:16:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-04 18:16:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2020-12-04 18:16:32,331 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 24 [2020-12-04 18:16:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:32,332 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2020-12-04 18:16:32,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:16:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2020-12-04 18:16:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-04 18:16:32,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:32,333 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:32,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-04 18:16:32,334 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2020-12-04 18:16:32,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:32,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163754466] [2020-12-04 18:16:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:32,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163754466] [2020-12-04 18:16:32,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:32,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:16:32,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369764854] [2020-12-04 18:16:32,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:16:32,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:16:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:16:32,768 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 6 states. [2020-12-04 18:16:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:35,252 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2020-12-04 18:16:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:16:35,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-04 18:16:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:35,254 INFO L225 Difference]: With dead ends: 243 [2020-12-04 18:16:35,255 INFO L226 Difference]: Without dead ends: 172 [2020-12-04 18:16:35,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:16:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-04 18:16:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 97. [2020-12-04 18:16:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-04 18:16:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2020-12-04 18:16:35,261 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 24 [2020-12-04 18:16:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:35,262 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2020-12-04 18:16:35,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:16:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2020-12-04 18:16:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-04 18:16:35,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:35,263 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:35,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-04 18:16:35,264 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2020-12-04 18:16:35,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:35,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395281742] [2020-12-04 18:16:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:35,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395281742] [2020-12-04 18:16:35,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:35,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:16:35,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749462737] [2020-12-04 18:16:35,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:16:35,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:16:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:16:35,722 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 8 states. [2020-12-04 18:16:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:36,291 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2020-12-04 18:16:36,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-04 18:16:36,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-12-04 18:16:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:36,294 INFO L225 Difference]: With dead ends: 169 [2020-12-04 18:16:36,294 INFO L226 Difference]: Without dead ends: 165 [2020-12-04 18:16:36,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:16:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-04 18:16:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 101. [2020-12-04 18:16:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-04 18:16:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2020-12-04 18:16:36,300 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 26 [2020-12-04 18:16:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:36,301 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2020-12-04 18:16:36,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:16:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2020-12-04 18:16:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-04 18:16:36,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:36,302 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:36,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-04 18:16:36,302 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:36,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:36,303 INFO L82 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2020-12-04 18:16:36,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:36,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502359989] [2020-12-04 18:16:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:38,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502359989] [2020-12-04 18:16:38,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:38,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-04 18:16:38,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157369171] [2020-12-04 18:16:38,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-04 18:16:38,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-04 18:16:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:16:38,895 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 13 states. [2020-12-04 18:16:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:43,239 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2020-12-04 18:16:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-04 18:16:43,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-12-04 18:16:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:43,242 INFO L225 Difference]: With dead ends: 186 [2020-12-04 18:16:43,242 INFO L226 Difference]: Without dead ends: 184 [2020-12-04 18:16:43,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=1574, Unknown=0, NotChecked=0, Total=1980 [2020-12-04 18:16:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-04 18:16:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 109. [2020-12-04 18:16:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-04 18:16:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2020-12-04 18:16:43,276 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 26 [2020-12-04 18:16:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:43,277 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2020-12-04 18:16:43,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-04 18:16:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2020-12-04 18:16:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-04 18:16:43,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:43,282 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:43,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-04 18:16:43,283 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1323553703, now seen corresponding path program 1 times [2020-12-04 18:16:43,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:43,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649245647] [2020-12-04 18:16:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:43,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649245647] [2020-12-04 18:16:43,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:43,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:16:43,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587699545] [2020-12-04 18:16:43,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:16:43,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:43,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:16:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:16:43,600 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 4 states. [2020-12-04 18:16:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:43,681 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-12-04 18:16:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:16:43,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-04 18:16:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:43,684 INFO L225 Difference]: With dead ends: 138 [2020-12-04 18:16:43,684 INFO L226 Difference]: Without dead ends: 109 [2020-12-04 18:16:43,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:16:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-04 18:16:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-12-04 18:16:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-04 18:16:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2020-12-04 18:16:43,695 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 26 [2020-12-04 18:16:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:43,696 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2020-12-04 18:16:43,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:16:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2020-12-04 18:16:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-04 18:16:43,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:43,697 INFO L422 BasicCegarLoop]: trace 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] [2020-12-04 18:16:43,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-04 18:16:43,698 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash -949909469, now seen corresponding path program 1 times [2020-12-04 18:16:43,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:43,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315022406] [2020-12-04 18:16:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:44,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315022406] [2020-12-04 18:16:44,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:44,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:16:44,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585023286] [2020-12-04 18:16:44,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:16:44,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:44,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:16:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:16:44,410 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 8 states. [2020-12-04 18:16:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:53,627 INFO L93 Difference]: Finished difference Result 317 states and 341 transitions. [2020-12-04 18:16:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-04 18:16:53,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-12-04 18:16:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:53,630 INFO L225 Difference]: With dead ends: 317 [2020-12-04 18:16:53,630 INFO L226 Difference]: Without dead ends: 252 [2020-12-04 18:16:53,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:16:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-12-04 18:16:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 104. [2020-12-04 18:16:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-04 18:16:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2020-12-04 18:16:53,638 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 26 [2020-12-04 18:16:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:53,639 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2020-12-04 18:16:53,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:16:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2020-12-04 18:16:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-04 18:16:53,640 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:53,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:53,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-04 18:16:53,640 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 971067806, now seen corresponding path program 1 times [2020-12-04 18:16:53,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:53,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409795197] [2020-12-04 18:16:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:54,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409795197] [2020-12-04 18:16:54,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:54,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:16:54,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956876913] [2020-12-04 18:16:54,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:16:54,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:54,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:16:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:16:54,110 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 6 states. [2020-12-04 18:16:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:16:56,814 INFO L93 Difference]: Finished difference Result 294 states and 331 transitions. [2020-12-04 18:16:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 18:16:56,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-12-04 18:16:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:16:56,817 INFO L225 Difference]: With dead ends: 294 [2020-12-04 18:16:56,817 INFO L226 Difference]: Without dead ends: 222 [2020-12-04 18:16:56,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:16:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-12-04 18:16:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 100. [2020-12-04 18:16:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-04 18:16:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2020-12-04 18:16:56,824 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 34 [2020-12-04 18:16:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:16:56,824 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2020-12-04 18:16:56,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:16:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2020-12-04 18:16:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-04 18:16:56,825 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:16:56,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:16:56,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-04 18:16:56,826 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:16:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:16:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2020-12-04 18:16:56,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:16:56,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775903514] [2020-12-04 18:16:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:16:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:16:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:16:59,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775903514] [2020-12-04 18:16:59,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:16:59,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:16:59,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221497015] [2020-12-04 18:16:59,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:16:59,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:16:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:16:59,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:16:59,213 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2020-12-04 18:17:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:03,924 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-12-04 18:17:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:17:03,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-12-04 18:17:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:03,926 INFO L225 Difference]: With dead ends: 100 [2020-12-04 18:17:03,926 INFO L226 Difference]: Without dead ends: 98 [2020-12-04 18:17:03,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-04 18:17:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-04 18:17:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-12-04 18:17:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-04 18:17:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2020-12-04 18:17:03,933 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 34 [2020-12-04 18:17:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:03,934 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2020-12-04 18:17:03,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:17:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2020-12-04 18:17:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:17:03,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:03,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:03,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-04 18:17:03,936 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2020-12-04 18:17:03,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:03,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303559983] [2020-12-04 18:17:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:06,637 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2020-12-04 18:17:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:06,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303559983] [2020-12-04 18:17:06,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:06,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:17:06,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81746400] [2020-12-04 18:17:06,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:17:06,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:06,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:17:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:17:06,762 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 9 states. [2020-12-04 18:17:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:13,932 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2020-12-04 18:17:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 18:17:13,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-12-04 18:17:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:13,934 INFO L225 Difference]: With dead ends: 162 [2020-12-04 18:17:13,934 INFO L226 Difference]: Without dead ends: 160 [2020-12-04 18:17:13,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:17:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-04 18:17:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-12-04 18:17:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-04 18:17:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2020-12-04 18:17:13,945 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 36 [2020-12-04 18:17:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:13,945 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2020-12-04 18:17:13,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:17:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2020-12-04 18:17:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:17:13,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:13,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:13,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-04 18:17:13,947 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2020-12-04 18:17:13,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:13,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936341756] [2020-12-04 18:17:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:14,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936341756] [2020-12-04 18:17:14,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:14,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:17:14,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102595572] [2020-12-04 18:17:14,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:17:14,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:17:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:17:14,412 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 5 states. [2020-12-04 18:17:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:16,848 INFO L93 Difference]: Finished difference Result 293 states and 321 transitions. [2020-12-04 18:17:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:17:16,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-12-04 18:17:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:16,851 INFO L225 Difference]: With dead ends: 293 [2020-12-04 18:17:16,851 INFO L226 Difference]: Without dead ends: 202 [2020-12-04 18:17:16,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:17:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-04 18:17:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 142. [2020-12-04 18:17:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-04 18:17:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2020-12-04 18:17:16,861 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 36 [2020-12-04 18:17:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:16,862 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2020-12-04 18:17:16,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:17:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2020-12-04 18:17:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:17:16,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:16,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:16,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-04 18:17:16,863 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:16,864 INFO L82 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2020-12-04 18:17:16,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:16,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615981695] [2020-12-04 18:17:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:19,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615981695] [2020-12-04 18:17:19,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:19,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:17:19,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679651867] [2020-12-04 18:17:19,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:17:19,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:17:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:17:19,268 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 9 states. [2020-12-04 18:17:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:24,249 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2020-12-04 18:17:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:17:24,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-12-04 18:17:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:24,253 INFO L225 Difference]: With dead ends: 199 [2020-12-04 18:17:24,253 INFO L226 Difference]: Without dead ends: 162 [2020-12-04 18:17:24,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-04 18:17:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-04 18:17:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-12-04 18:17:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-04 18:17:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2020-12-04 18:17:24,264 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 36 [2020-12-04 18:17:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:24,264 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2020-12-04 18:17:24,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:17:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2020-12-04 18:17:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:17:24,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:24,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:24,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-04 18:17:24,266 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2020-12-04 18:17:24,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:24,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208652058] [2020-12-04 18:17:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:24,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208652058] [2020-12-04 18:17:24,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:24,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:17:24,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510507790] [2020-12-04 18:17:24,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:17:24,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:17:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:17:24,919 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 9 states. [2020-12-04 18:17:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:27,905 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2020-12-04 18:17:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:17:27,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-12-04 18:17:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:27,908 INFO L225 Difference]: With dead ends: 197 [2020-12-04 18:17:27,908 INFO L226 Difference]: Without dead ends: 158 [2020-12-04 18:17:27,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:17:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-04 18:17:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2020-12-04 18:17:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-04 18:17:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2020-12-04 18:17:27,918 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 36 [2020-12-04 18:17:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:27,918 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2020-12-04 18:17:27,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:17:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2020-12-04 18:17:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:17:27,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:27,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:27,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-04 18:17:27,920 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1992548114, now seen corresponding path program 1 times [2020-12-04 18:17:27,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:27,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444773893] [2020-12-04 18:17:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:28,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444773893] [2020-12-04 18:17:28,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:28,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 18:17:28,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429328557] [2020-12-04 18:17:28,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 18:17:28,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 18:17:28,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:17:28,695 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 10 states. [2020-12-04 18:17:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:31,931 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2020-12-04 18:17:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-04 18:17:31,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2020-12-04 18:17:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:31,934 INFO L225 Difference]: With dead ends: 185 [2020-12-04 18:17:31,934 INFO L226 Difference]: Without dead ends: 158 [2020-12-04 18:17:31,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:17:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-04 18:17:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2020-12-04 18:17:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-04 18:17:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2020-12-04 18:17:31,944 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 36 [2020-12-04 18:17:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:31,944 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2020-12-04 18:17:31,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 18:17:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2020-12-04 18:17:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:17:31,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:31,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:31,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-04 18:17:31,946 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2020-12-04 18:17:31,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:31,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105479205] [2020-12-04 18:17:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:32,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105479205] [2020-12-04 18:17:32,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:32,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:17:32,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838081968] [2020-12-04 18:17:32,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:17:32,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:17:32,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:17:32,459 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 6 states. [2020-12-04 18:17:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:36,863 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2020-12-04 18:17:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:17:36,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-04 18:17:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:36,866 INFO L225 Difference]: With dead ends: 136 [2020-12-04 18:17:36,866 INFO L226 Difference]: Without dead ends: 134 [2020-12-04 18:17:36,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:17:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-12-04 18:17:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-12-04 18:17:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-04 18:17:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2020-12-04 18:17:36,877 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 38 [2020-12-04 18:17:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:36,877 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2020-12-04 18:17:36,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:17:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2020-12-04 18:17:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:17:36,878 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:36,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:36,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-04 18:17:36,879 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2020-12-04 18:17:36,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:36,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25493937] [2020-12-04 18:17:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:37,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25493937] [2020-12-04 18:17:37,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:37,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:17:37,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469106383] [2020-12-04 18:17:37,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:17:37,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:37,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:17:37,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:17:37,670 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 11 states. [2020-12-04 18:17:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:41,092 INFO L93 Difference]: Finished difference Result 210 states and 217 transitions. [2020-12-04 18:17:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-04 18:17:41,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-12-04 18:17:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:41,095 INFO L225 Difference]: With dead ends: 210 [2020-12-04 18:17:41,096 INFO L226 Difference]: Without dead ends: 184 [2020-12-04 18:17:41,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:17:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-04 18:17:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2020-12-04 18:17:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-04 18:17:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2020-12-04 18:17:41,106 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 38 [2020-12-04 18:17:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:41,106 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2020-12-04 18:17:41,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:17:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2020-12-04 18:17:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-04 18:17:41,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:41,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:41,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-04 18:17:41,108 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2020-12-04 18:17:41,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:41,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95114503] [2020-12-04 18:17:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:41,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95114503] [2020-12-04 18:17:41,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:41,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:17:41,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509792498] [2020-12-04 18:17:41,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:17:41,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:41,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:17:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:17:41,618 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2020-12-04 18:17:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:46,211 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2020-12-04 18:17:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:17:46,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-04 18:17:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:46,213 INFO L225 Difference]: With dead ends: 142 [2020-12-04 18:17:46,213 INFO L226 Difference]: Without dead ends: 81 [2020-12-04 18:17:46,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:17:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-04 18:17:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-12-04 18:17:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-04 18:17:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2020-12-04 18:17:46,219 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 41 [2020-12-04 18:17:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:46,219 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2020-12-04 18:17:46,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:17:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2020-12-04 18:17:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-04 18:17:46,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:46,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:46,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-04 18:17:46,221 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1999613423, now seen corresponding path program 1 times [2020-12-04 18:17:46,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:46,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068945468] [2020-12-04 18:17:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:46,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068945468] [2020-12-04 18:17:46,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:46,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:17:46,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196217595] [2020-12-04 18:17:46,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:17:46,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:17:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:17:46,833 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2020-12-04 18:17:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:49,361 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-12-04 18:17:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:17:49,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-12-04 18:17:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:49,365 INFO L225 Difference]: With dead ends: 143 [2020-12-04 18:17:49,365 INFO L226 Difference]: Without dead ends: 81 [2020-12-04 18:17:49,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:17:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-04 18:17:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-12-04 18:17:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-04 18:17:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2020-12-04 18:17:49,371 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 42 [2020-12-04 18:17:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:49,371 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2020-12-04 18:17:49,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:17:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2020-12-04 18:17:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-04 18:17:49,371 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:49,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:49,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-04 18:17:49,372 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1865599917, now seen corresponding path program 1 times [2020-12-04 18:17:49,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:49,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546732462] [2020-12-04 18:17:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:49,965 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2020-12-04 18:17:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:17:50,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546732462] [2020-12-04 18:17:50,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:17:50,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:17:50,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447803116] [2020-12-04 18:17:50,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:17:50,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:17:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:17:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:17:50,237 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 9 states. [2020-12-04 18:17:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:17:55,552 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2020-12-04 18:17:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 18:17:55,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-12-04 18:17:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:17:55,556 INFO L225 Difference]: With dead ends: 118 [2020-12-04 18:17:55,556 INFO L226 Difference]: Without dead ends: 79 [2020-12-04 18:17:55,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:17:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-04 18:17:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-04 18:17:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-04 18:17:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2020-12-04 18:17:55,562 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 42 [2020-12-04 18:17:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:17:55,562 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2020-12-04 18:17:55,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:17:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-12-04 18:17:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-04 18:17:55,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:17:55,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:17:55,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-04 18:17:55,564 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:17:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:17:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1320234431, now seen corresponding path program 1 times [2020-12-04 18:17:55,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:17:55,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170733725] [2020-12-04 18:17:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:17:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:17:59,789 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2020-12-04 18:18:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:00,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170733725] [2020-12-04 18:18:00,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:00,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 18:18:00,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719571519] [2020-12-04 18:18:00,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 18:18:00,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 18:18:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:18:00,137 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 10 states. [2020-12-04 18:18:02,745 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-12-04 18:18:02,873 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-12-04 18:18:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:03,374 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2020-12-04 18:18:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-04 18:18:03,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-12-04 18:18:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:03,379 INFO L225 Difference]: With dead ends: 112 [2020-12-04 18:18:03,379 INFO L226 Difference]: Without dead ends: 71 [2020-12-04 18:18:03,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:18:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-04 18:18:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-04 18:18:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-04 18:18:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2020-12-04 18:18:03,387 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 42 [2020-12-04 18:18:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:03,388 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2020-12-04 18:18:03,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 18:18:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2020-12-04 18:18:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-04 18:18:03,389 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:18:03,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:18:03,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-04 18:18:03,390 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:18:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:18:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1283557245, now seen corresponding path program 1 times [2020-12-04 18:18:03,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:18:03,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675301100] [2020-12-04 18:18:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:18:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:18:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:08,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675301100] [2020-12-04 18:18:08,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:08,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:18:08,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57855263] [2020-12-04 18:18:08,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:18:08,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:18:08,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:18:08,220 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 9 states. [2020-12-04 18:18:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:11,285 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2020-12-04 18:18:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 18:18:11,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-12-04 18:18:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:11,289 INFO L225 Difference]: With dead ends: 98 [2020-12-04 18:18:11,289 INFO L226 Difference]: Without dead ends: 71 [2020-12-04 18:18:11,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:18:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-04 18:18:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-04 18:18:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-04 18:18:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2020-12-04 18:18:11,296 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 42 [2020-12-04 18:18:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:11,296 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2020-12-04 18:18:11,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:18:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2020-12-04 18:18:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:18:11,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:18:11,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:18:11,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-04 18:18:11,298 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:18:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:18:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1150640246, now seen corresponding path program 1 times [2020-12-04 18:18:11,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:18:11,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321413143] [2020-12-04 18:18:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:18:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:18:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:13,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321413143] [2020-12-04 18:18:13,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:13,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-04 18:18:13,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970636006] [2020-12-04 18:18:13,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-04 18:18:13,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-04 18:18:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:18:13,855 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 14 states. [2020-12-04 18:18:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:19,755 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2020-12-04 18:18:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-04 18:18:19,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2020-12-04 18:18:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:19,759 INFO L225 Difference]: With dead ends: 71 [2020-12-04 18:18:19,759 INFO L226 Difference]: Without dead ends: 69 [2020-12-04 18:18:19,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-12-04 18:18:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-04 18:18:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-12-04 18:18:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-04 18:18:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2020-12-04 18:18:19,766 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 44 [2020-12-04 18:18:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:19,766 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2020-12-04 18:18:19,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-04 18:18:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2020-12-04 18:18:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-04 18:18:19,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:18:19,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:18:19,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-04 18:18:19,768 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:18:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:18:19,768 INFO L82 PathProgramCache]: Analyzing trace with hash 962797916, now seen corresponding path program 1 times [2020-12-04 18:18:19,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:18:19,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631010785] [2020-12-04 18:18:19,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:18:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:18:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:20,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631010785] [2020-12-04 18:18:20,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:20,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:18:20,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128903183] [2020-12-04 18:18:20,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:18:20,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:18:20,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:18:20,527 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 9 states. [2020-12-04 18:18:25,019 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-12-04 18:18:25,594 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2020-12-04 18:18:25,810 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-04 18:18:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:25,950 INFO L93 Difference]: Finished difference Result 89 states and 88 transitions. [2020-12-04 18:18:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:18:25,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-12-04 18:18:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:25,955 INFO L225 Difference]: With dead ends: 89 [2020-12-04 18:18:25,955 INFO L226 Difference]: Without dead ends: 63 [2020-12-04 18:18:25,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:18:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-04 18:18:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-04 18:18:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-04 18:18:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 62 transitions. [2020-12-04 18:18:25,961 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 62 transitions. Word has length 48 [2020-12-04 18:18:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:25,962 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 62 transitions. [2020-12-04 18:18:25,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:18:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 62 transitions. [2020-12-04 18:18:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-04 18:18:25,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:18:25,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:18:25,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-04 18:18:25,963 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:18:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:18:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1220963354, now seen corresponding path program 1 times [2020-12-04 18:18:25,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:18:25,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875274778] [2020-12-04 18:18:25,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:18:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:18:28,717 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2020-12-04 18:18:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:28,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875274778] [2020-12-04 18:18:28,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:28,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:18:28,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095697135] [2020-12-04 18:18:28,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:18:28,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:28,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:18:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:18:28,914 INFO L87 Difference]: Start difference. First operand 63 states and 62 transitions. Second operand 9 states. [2020-12-04 18:18:36,021 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2020-12-04 18:18:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:36,140 INFO L93 Difference]: Finished difference Result 63 states and 62 transitions. [2020-12-04 18:18:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 18:18:36,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-12-04 18:18:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:36,147 INFO L225 Difference]: With dead ends: 63 [2020-12-04 18:18:36,147 INFO L226 Difference]: Without dead ends: 61 [2020-12-04 18:18:36,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:18:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-04 18:18:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-04 18:18:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-04 18:18:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2020-12-04 18:18:36,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 48 [2020-12-04 18:18:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:36,155 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2020-12-04 18:18:36,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:18:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2020-12-04 18:18:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-04 18:18:36,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:18:36,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:18:36,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-04 18:18:36,157 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:18:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:18:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1599746443, now seen corresponding path program 1 times [2020-12-04 18:18:36,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:18:36,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889605579] [2020-12-04 18:18:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:18:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:18:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:38,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889605579] [2020-12-04 18:18:38,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:38,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:18:38,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377963109] [2020-12-04 18:18:38,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:18:38,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:18:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:18:38,766 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand 9 states. [2020-12-04 18:18:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:43,862 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2020-12-04 18:18:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:18:43,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-12-04 18:18:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:43,870 INFO L225 Difference]: With dead ends: 61 [2020-12-04 18:18:43,870 INFO L226 Difference]: Without dead ends: 59 [2020-12-04 18:18:43,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:18:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-04 18:18:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-12-04 18:18:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-04 18:18:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 58 transitions. [2020-12-04 18:18:43,878 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 58 transitions. Word has length 53 [2020-12-04 18:18:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:43,879 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 58 transitions. [2020-12-04 18:18:43,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:18:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 58 transitions. [2020-12-04 18:18:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-04 18:18:43,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:18:43,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:18:43,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-04 18:18:43,881 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:18:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:18:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash 919461545, now seen corresponding path program 1 times [2020-12-04 18:18:43,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:18:43,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630269530] [2020-12-04 18:18:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:18:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:18:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:18:54,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630269530] [2020-12-04 18:18:54,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:18:54,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 18:18:54,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144554273] [2020-12-04 18:18:54,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 18:18:54,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:18:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 18:18:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:18:54,491 INFO L87 Difference]: Start difference. First operand 59 states and 58 transitions. Second operand 10 states. [2020-12-04 18:18:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:18:59,536 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2020-12-04 18:18:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:18:59,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-12-04 18:18:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:18:59,539 INFO L225 Difference]: With dead ends: 59 [2020-12-04 18:18:59,539 INFO L226 Difference]: Without dead ends: 0 [2020-12-04 18:18:59,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:18:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-04 18:18:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-04 18:18:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-04 18:18:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-04 18:18:59,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2020-12-04 18:18:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:18:59,542 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-04 18:18:59,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 18:18:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-04 18:18:59,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-04 18:18:59,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-04 18:18:59,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-04 18:19:00,785 WARN L197 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 92 [2020-12-04 18:19:03,042 WARN L197 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 174 DAG size of output: 94 [2020-12-04 18:19:04,291 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 132 DAG size of output: 79 [2020-12-04 18:19:06,611 WARN L197 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 165 DAG size of output: 101 [2020-12-04 18:19:06,617 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,618 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-04 18:19:06,618 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,618 INFO L262 CegarLoopResult]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2020-12-04 18:19:06,618 INFO L262 CegarLoopResult]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2020-12-04 18:19:06,619 INFO L258 CegarLoopResult]: At program point L8215(lines 8203 8216) the Hoare annotation is: (let ((.cse13 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse12 (select .cse13 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse4 (select .cse13 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse0 (not (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base 0))) (.cse1 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (.cse2 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.offset| 0)) (.cse5 (<= (* 4294967296 (div (+ .cse4 (* (div .cse12 4294967296) 4294967296) (* .cse12 (- 1)) 4294967295) 4294967296)) .cse4)) (.cse6 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.len|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.offset| 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 (* 4294967296 (div .cse4 4294967296))) .cse5 .cse6 .cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| 0) .cse8 (<= ULTIMATE.start_aws_byte_buf_from_array_~len (* 4294967296 (div ULTIMATE.start_aws_byte_buf_from_array_~len 4294967296))) .cse9 .cse10 .cse11) (and (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse1 .cse2 .cse3 .cse5 .cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) .cse7 (<= |ULTIMATE.start_aws_byte_buf_from_array_#res.len| (+ (* 4294967296 (div (+ |ULTIMATE.start_aws_byte_buf_from_array_#res.len| (- 1)) 4294967296)) 4294967295)) (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse8 .cse9 .cse10 (<= .cse12 (+ (* 4294967296 (div (+ (* .cse4 (- 1)) (* (div (+ .cse4 (- 1)) 4294967296) 4294967296) .cse12) 4294967296)) 4294967295)) .cse11))))) [2020-12-04 18:19:06,619 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:19:06,620 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:19:06,620 INFO L262 CegarLoopResult]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:19:06,620 INFO L262 CegarLoopResult]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:19:06,621 INFO L262 CegarLoopResult]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2020-12-04 18:19:06,621 INFO L262 CegarLoopResult]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:19:06,621 INFO L262 CegarLoopResult]: For program point L222-5(lines 7101 7111) no Hoare annotation was computed. [2020-12-04 18:19:06,621 INFO L262 CegarLoopResult]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:19:06,621 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-04 18:19:06,622 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,622 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,622 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,622 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,622 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,622 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,623 INFO L262 CegarLoopResult]: For program point L223-9(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,623 INFO L262 CegarLoopResult]: For program point L223-10(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,623 INFO L262 CegarLoopResult]: For program point L223-12(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,623 INFO L262 CegarLoopResult]: For program point L223-13(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,623 INFO L262 CegarLoopResult]: For program point L223-15(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,623 INFO L262 CegarLoopResult]: For program point L223-16(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,624 INFO L262 CegarLoopResult]: For program point L223-18(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,624 INFO L262 CegarLoopResult]: For program point L223-19(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,624 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,624 INFO L265 CegarLoopResult]: At program point L8978(line 8978) the Hoare annotation is: true [2020-12-04 18:19:06,624 INFO L262 CegarLoopResult]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2020-12-04 18:19:06,625 INFO L262 CegarLoopResult]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2020-12-04 18:19:06,625 INFO L262 CegarLoopResult]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,625 INFO L262 CegarLoopResult]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,625 INFO L262 CegarLoopResult]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2020-12-04 18:19:06,625 INFO L262 CegarLoopResult]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2020-12-04 18:19:06,625 INFO L262 CegarLoopResult]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,626 INFO L262 CegarLoopResult]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,626 INFO L262 CegarLoopResult]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2020-12-04 18:19:06,626 INFO L262 CegarLoopResult]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,627 INFO L258 CegarLoopResult]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse26 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base|)) (.cse20 (select .cse26 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse8 (select .cse26 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 4)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base|)) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 16))) (let ((.cse0 (= (select .cse25 .cse24) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse4 (not (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base 0))) (.cse5 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse14 (select .cse25 .cse23)) (.cse6 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (.cse7 (= 0 (select .cse22 .cse24))) (.cse9 (<= (* 4294967296 (div (+ .cse8 (* (div .cse20 4294967296) 4294967296) (* .cse20 (- 1)) 4294967295) 4294967296)) .cse8)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse13 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 .cse8)) (.cse15 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len)) (.cse16 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse17 (= (select .cse22 .cse23) 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0)) (.cse11 (select .cse21 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 12)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 (* 4294967296 (div .cse8 4294967296))) .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 .cse11) .cse12 .cse13 (= .cse14 0) .cse15 .cse16 .cse17 .cse18) (let ((.cse19 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset|))) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse4 .cse5 (= .cse14 ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse6 .cse7 .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) .cse12 .cse13 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse15 .cse16 (<= .cse11 .cse19) .cse17 .cse18 (<= .cse20 (+ (* 4294967296 (div (+ .cse20 (- 1)) 4294967296)) 4294967295)) (<= .cse19 .cse11))))))) [2020-12-04 18:19:06,627 INFO L262 CegarLoopResult]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2020-12-04 18:19:06,627 INFO L262 CegarLoopResult]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2020-12-04 18:19:06,627 INFO L262 CegarLoopResult]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2020-12-04 18:19:06,627 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,628 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-04 18:19:06,628 INFO L262 CegarLoopResult]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,628 INFO L262 CegarLoopResult]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,629 INFO L258 CegarLoopResult]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse26 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 4)) (.cse27 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 16))) (let ((.cse0 (= (select .cse27 .cse24) 0)) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (not (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base 0))) (.cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse4 (select .cse27 .cse25)) (.cse7 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (.cse2 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.offset| 0)) (.cse20 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse8 (= (select .cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 12)) ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2)) (.cse9 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.len|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (select .cse26 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset|))) (.cse11 (= 0 (select .cse23 .cse25))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.offset| 0)) (.cse13 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse14 (= (select .cse23 .cse24) 0)) (.cse15 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len)) (.cse16 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.base| 0))) (or (and .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|) (= .cse4 ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse5 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) .cse13 .cse14 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse15 .cse16 .cse17 .cse18 (let ((.cse19 (select .cse20 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= .cse19 (+ (* 4294967296 (div (+ .cse19 (- 1)) 4294967296)) 4294967295)))) (let ((.cse22 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4))) (and .cse0 .cse5 .cse1 .cse6 (= .cse4 0) .cse7 .cse2 .cse3 (let ((.cse21 (select .cse20 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse21 (* 4294967296 (div .cse21 4294967296)))) .cse8 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse22) 0) .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| 0) .cse14 .cse15 (<= ULTIMATE.start_aws_byte_buf_from_array_~len (* 4294967296 (div ULTIMATE.start_aws_byte_buf_from_array_~len 4294967296))) .cse16 .cse17 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse22) 0) .cse18))))) [2020-12-04 18:19:06,629 INFO L262 CegarLoopResult]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,629 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:19:06,629 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:19:06,629 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:19:06,629 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,630 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-04 18:19:06,630 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-04 18:19:06,630 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-04 18:19:06,630 INFO L262 CegarLoopResult]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2020-12-04 18:19:06,630 INFO L262 CegarLoopResult]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,630 INFO L262 CegarLoopResult]: For program point L7380(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2020-12-04 18:19:06,631 INFO L262 CegarLoopResult]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,632 INFO L262 CegarLoopResult]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,632 INFO L262 CegarLoopResult]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,632 INFO L262 CegarLoopResult]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,632 INFO L262 CegarLoopResult]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,632 INFO L262 CegarLoopResult]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2020-12-04 18:19:06,633 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,633 INFO L258 CegarLoopResult]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) [2020-12-04 18:19:06,633 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-04 18:19:06,633 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:19:06,634 INFO L258 CegarLoopResult]: At program point L266(line 266) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 4))) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 16))) (and (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.offset| 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|) (= .cse2 ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (= ULTIMATE.start_assert_bytes_match_~a.offset 0) (= (select .cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 12)) ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.len|) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset|)) (= 0 (select .cse4 .cse5)) (not (= .cse2 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.offset| 0) (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= (select .cse4 .cse1) 0) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0) (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.base| 0) (let ((.cse6 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= .cse6 (+ (* 4294967296 (div (+ .cse6 (- 1)) 4294967296)) 4294967295)))))) [2020-12-04 18:19:06,647 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,650 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,651 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,652 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,652 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,653 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,653 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,662 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,663 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,664 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,665 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,665 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,665 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,666 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,672 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,675 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,676 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,676 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,677 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,677 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,678 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,692 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,692 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,700 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,701 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,704 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,704 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,705 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,705 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,705 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,706 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,710 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,710 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,711 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,711 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,712 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,712 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,713 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,715 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,721 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,722 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,723 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,723 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,727 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,728 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,728 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,731 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,735 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,736 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,737 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,737 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,738 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,740 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:06,740 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,741 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,741 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,741 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,741 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:06,742 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:06,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 06:19:06 BoogieIcfgContainer [2020-12-04 18:19:06,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 18:19:06,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 18:19:06,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 18:19:06,748 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 18:19:06,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:16:09" (3/4) ... [2020-12-04 18:19:06,753 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-04 18:19:06,799 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2020-12-04 18:19:06,802 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2020-12-04 18:19:06,804 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2020-12-04 18:19:06,806 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-04 18:19:06,808 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-04 18:19:06,809 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-04 18:19:06,811 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-04 18:19:06,813 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-04 18:19:06,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 && !(\result == 0) [2020-12-04 18:19:06,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && buf == buf) && !(buf == 0)) && 1 <= \result) && !(bytes == 0)) && \result <= 1) && !(0 == buf)) && 0 == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && length == unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) && length == unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 4] == 0) && length == len) && !(\result == 0)) && #memory_$Pointer$[buf][buf + 4] == 0) && buf == 0) || (((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && buf == buf) && !(buf == 0)) && 1 <= \result) && array == 0) && \result == 0) && !(bytes == 0)) && \result <= 1) && #memory_$Pointer$[buf][buf + 4] == array) && !(0 == buf)) && 0 == #memory_$Pointer$[buf][buf + 16]) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && bytes == 0) && buf == 0) && length == unknown-#memory_int-unknown[buf][buf]) && bytes == array) && length == len) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 4] == 0) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][buf + 12]) [2020-12-04 18:19:06,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(bytes == 0) && !(0 == buf)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && length == unknown-#res!len-unknown) && aws_byte_buf_from_array_#res.allocator == 0) && aws_byte_buf_from_array_#res.buffer == 0) && length == len) && len <= 4294967296 * (len / 4294967296)) && !(\result == 0)) && buf == 0) && aws_byte_buf_from_array_#res.allocator == 0) || (((((((((((((((((array == 0 && !(bytes == 0)) && \result == 0) && !(0 == buf)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && length == unknown-#res!len-unknown) && aws_byte_buf_from_array_#res.buffer == array) && bytes == 0) && aws_byte_buf_from_array_#res.allocator == 0) && unknown-#res!len-unknown <= 4294967296 * ((unknown-#res!len-unknown + -1) / 4294967296) + 4294967295) && bytes == array) && length == len) && !(\result == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] * -1 + (unknown-#memory_int-unknown[buf][buf] + -1) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) + 4294967295) && aws_byte_buf_from_array_#res.allocator == 0) [2020-12-04 18:19:06,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && \result == 0) && !(bytes == 0)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && buf == buf) && #memory_$Pointer$[buf][buf + 4] == array) && aws_byte_buf_from_array_#res.buffer == array) && 1 <= \result) && array == 0) && \result <= 1) && !(0 == buf)) && unknown-#memory_int-unknown[buf][buf + 12] == length) && length == unknown-#res!len-unknown) && length == unknown-#memory_int-unknown[buf][buf]) && 0 == #memory_$Pointer$[buf][buf + 4]) && aws_byte_buf_from_array_#res.allocator == 0) && bytes == 0) && buf == 0) && #memory_$Pointer$[buf][buf + 16] == 0) && bytes == array) && length == len) && !(\result == 0)) && buf == 0) && aws_byte_buf_from_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) || (((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && 1 <= \result) && !(bytes == 0)) && \result <= 1) && #memory_$Pointer$[buf][buf + 4] == 0) && !(0 == buf)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && unknown-#memory_int-unknown[buf][buf + 12] == length) && #memory_$Pointer$[buf][buf + 4] == 0) && length == unknown-#res!len-unknown) && length == unknown-#memory_int-unknown[buf][buf]) && 0 == #memory_$Pointer$[buf][buf + 4]) && aws_byte_buf_from_array_#res.allocator == 0) && buf == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 16] == 0) && length == len) && len <= 4294967296 * (len / 4294967296)) && !(\result == 0)) && buf == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && aws_byte_buf_from_array_#res.allocator == 0) [2020-12-04 18:19:06,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && \result == 0) && b == 0) && 1 <= cond) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && buf == buf) && #memory_$Pointer$[buf][buf + 4] == array) && aws_byte_buf_from_array_#res.buffer == array) && 1 <= \result) && array == 0) && \result <= 1) && !(0 == buf)) && a == 0) && unknown-#memory_int-unknown[buf][buf + 12] == length) && length == unknown-#res!len-unknown) && length == unknown-#memory_int-unknown[buf][buf]) && 0 == #memory_$Pointer$[buf][buf + 4]) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && aws_byte_buf_from_array_#res.allocator == 0) && bytes == 0) && buf == 0) && #memory_$Pointer$[buf][buf + 16] == 0) && a == b) && cond / 256 <= 0) && bytes == array) && length == len) && !(\result == 0)) && buf == 0) && aws_byte_buf_from_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295 [2020-12-04 18:19:08,025 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-04 18:19:08,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 18:19:08,027 INFO L168 Benchmark]: Toolchain (without parser) took 193156.83 ms. Allocated memory was 54.5 MB in the beginning and 1.0 GB in the end (delta: 985.7 MB). Free memory was 32.3 MB in the beginning and 677.6 MB in the end (delta: -645.3 MB). Peak memory consumption was 678.0 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,028 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 44.0 MB. Free memory was 22.5 MB in the beginning and 22.4 MB in the end (delta: 28.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 18:19:08,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 4157.40 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 32.0 MB in the beginning and 112.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 257.28 ms. Allocated memory is still 174.1 MB. Free memory was 112.1 MB in the beginning and 100.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,029 INFO L168 Benchmark]: Boogie Preprocessor took 172.52 ms. Allocated memory is still 174.1 MB. Free memory was 100.5 MB in the beginning and 92.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,030 INFO L168 Benchmark]: RCFGBuilder took 9856.14 ms. Allocated memory was 174.1 MB in the beginning and 524.3 MB in the end (delta: 350.2 MB). Free memory was 92.2 MB in the beginning and 263.1 MB in the end (delta: -170.9 MB). Peak memory consumption was 234.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,030 INFO L168 Benchmark]: TraceAbstraction took 177423.30 ms. Allocated memory was 524.3 MB in the beginning and 1.0 GB in the end (delta: 515.9 MB). Free memory was 262.0 MB in the beginning and 891.1 MB in the end (delta: -629.0 MB). Peak memory consumption was 413.2 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,031 INFO L168 Benchmark]: Witness Printer took 1277.40 ms. Allocated memory is still 1.0 GB. Free memory was 891.1 MB in the beginning and 677.6 MB in the end (delta: 213.4 MB). Peak memory consumption was 547.9 MB. Max. memory is 16.1 GB. [2020-12-04 18:19:08,034 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.28 ms. Allocated memory is still 44.0 MB. Free memory was 22.5 MB in the beginning and 22.4 MB in the end (delta: 28.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 4157.40 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 32.0 MB in the beginning and 112.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 257.28 ms. Allocated memory is still 174.1 MB. Free memory was 112.1 MB in the beginning and 100.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 172.52 ms. Allocated memory is still 174.1 MB. Free memory was 100.5 MB in the beginning and 92.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9856.14 ms. Allocated memory was 174.1 MB in the beginning and 524.3 MB in the end (delta: 350.2 MB). Free memory was 92.2 MB in the beginning and 263.1 MB in the end (delta: -170.9 MB). Peak memory consumption was 234.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 177423.30 ms. Allocated memory was 524.3 MB in the beginning and 1.0 GB in the end (delta: 515.9 MB). Free memory was 262.0 MB in the beginning and 891.1 MB in the end (delta: -629.0 MB). Peak memory consumption was 413.2 MB. Max. memory is 16.1 GB. * Witness Printer took 1277.40 ms. Allocated memory is still 1.0 GB. Free memory was 891.1 MB in the beginning and 677.6 MB in the end (delta: 213.4 MB). Peak memory consumption was 547.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2020-12-04 18:19:08,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,051 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,052 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,053 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,053 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,055 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,055 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,055 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,056 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,057 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,058 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && \result == 0) && b == 0) && 1 <= cond) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && buf == buf) && #memory_$Pointer$[buf][buf + 4] == array) && aws_byte_buf_from_array_#res.buffer == array) && 1 <= \result) && array == 0) && \result <= 1) && !(0 == buf)) && a == 0) && unknown-#memory_int-unknown[buf][buf + 12] == length) && length == unknown-#res!len-unknown) && length == unknown-#memory_int-unknown[buf][buf]) && 0 == #memory_$Pointer$[buf][buf + 4]) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && aws_byte_buf_from_array_#res.allocator == 0) && bytes == 0) && buf == 0) && #memory_$Pointer$[buf][buf + 16] == 0) && a == b) && cond / 256 <= 0) && bytes == array) && length == len) && !(\result == 0)) && buf == 0) && aws_byte_buf_from_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: \result == 0 && !(\result == 0) - InvariantResult [Line: 7375]: Loop Invariant [2020-12-04 18:19:08,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,063 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && buf == buf) && !(buf == 0)) && 1 <= \result) && !(bytes == 0)) && \result <= 1) && !(0 == buf)) && 0 == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && length == unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) && length == unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 4] == 0) && length == len) && !(\result == 0)) && #memory_$Pointer$[buf][buf + 4] == 0) && buf == 0) || (((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && buf == buf) && !(buf == 0)) && 1 <= \result) && array == 0) && \result == 0) && !(bytes == 0)) && \result <= 1) && #memory_$Pointer$[buf][buf + 4] == array) && !(0 == buf)) && 0 == #memory_$Pointer$[buf][buf + 16]) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && bytes == 0) && buf == 0) && length == unknown-#memory_int-unknown[buf][buf]) && bytes == array) && length == len) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 4] == 0) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][buf + 12]) - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8203]: Loop Invariant [2020-12-04 18:19:08,068 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,068 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,068 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,068 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,069 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,069 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,069 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,070 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,071 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,071 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,071 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,072 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,072 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,072 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,072 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,073 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((!(bytes == 0) && !(0 == buf)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && length == unknown-#res!len-unknown) && aws_byte_buf_from_array_#res.allocator == 0) && aws_byte_buf_from_array_#res.buffer == 0) && length == len) && len <= 4294967296 * (len / 4294967296)) && !(\result == 0)) && buf == 0) && aws_byte_buf_from_array_#res.allocator == 0) || (((((((((((((((((array == 0 && !(bytes == 0)) && \result == 0) && !(0 == buf)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][buf + 12] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && length == unknown-#res!len-unknown) && aws_byte_buf_from_array_#res.buffer == array) && bytes == 0) && aws_byte_buf_from_array_#res.allocator == 0) && unknown-#res!len-unknown <= 4294967296 * ((unknown-#res!len-unknown + -1) / 4294967296) + 4294967295) && bytes == array) && length == len) && !(\result == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] * -1 + (unknown-#memory_int-unknown[buf][buf] + -1) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) + 4294967295) && aws_byte_buf_from_array_#res.allocator == 0) - InvariantResult [Line: 7375]: Loop Invariant [2020-12-04 18:19:08,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,074 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,075 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,076 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,076 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,077 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,077 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,077 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,078 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,078 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,078 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,078 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,079 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,079 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,080 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,081 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,081 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,081 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,082 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,082 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,082 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,082 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,083 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:19:08,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,084 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,084 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2020-12-04 18:19:08,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:19:08,085 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && \result == 0) && !(bytes == 0)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && buf == buf) && #memory_$Pointer$[buf][buf + 4] == array) && aws_byte_buf_from_array_#res.buffer == array) && 1 <= \result) && array == 0) && \result <= 1) && !(0 == buf)) && unknown-#memory_int-unknown[buf][buf + 12] == length) && length == unknown-#res!len-unknown) && length == unknown-#memory_int-unknown[buf][buf]) && 0 == #memory_$Pointer$[buf][buf + 4]) && aws_byte_buf_from_array_#res.allocator == 0) && bytes == 0) && buf == 0) && #memory_$Pointer$[buf][buf + 16] == 0) && bytes == array) && length == len) && !(\result == 0)) && buf == 0) && aws_byte_buf_from_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) || (((((((((((((((((((((((#memory_$Pointer$[buf][buf + 16] == 0 && 1 <= \result) && !(bytes == 0)) && \result <= 1) && #memory_$Pointer$[buf][buf + 4] == 0) && !(0 == buf)) && length == unknown-#res!capacity-unknown) && aws_byte_buf_from_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && unknown-#memory_int-unknown[buf][buf + 12] == length) && #memory_$Pointer$[buf][buf + 4] == 0) && length == unknown-#res!len-unknown) && length == unknown-#memory_int-unknown[buf][buf]) && 0 == #memory_$Pointer$[buf][buf + 4]) && aws_byte_buf_from_array_#res.allocator == 0) && buf == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 16] == 0) && length == len) && len <= 4294967296 * (len / 4294967296)) && !(\result == 0)) && buf == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && aws_byte_buf_from_array_#res.allocator == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 170.1s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 111.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2678 SDtfs, 4631 SDslu, 8789 SDs, 0 SdLazy, 3779 SolverSat, 382 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 96.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 69 SyntacticMatches, 14 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=17, 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, 33 MinimizatonAttempts, 957 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 999 HoareAnnotationTreeSize, 6 FomulaSimplifications, 164237 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 42260 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 43.4s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1096 NumberOfCodeBlocks, 1096 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1063 ConstructedInterpolants, 0 QuantifiedInterpolants, 436084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...