./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_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 c2c8100e1f648cee1922c84a2421989bafb670d4445ddc160c17e3cd878eaa49 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 23:47:32,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 23:47:32,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 23:47:32,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 23:47:32,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 23:47:32,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 23:47:32,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 23:47:32,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 23:47:32,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 23:47:32,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 23:47:32,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 23:47:32,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 23:47:32,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 23:47:32,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 23:47:32,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 23:47:32,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 23:47:32,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 23:47:32,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 23:47:32,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 23:47:32,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 23:47:32,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 23:47:32,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 23:47:32,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 23:47:32,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 23:47:32,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 23:47:32,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 23:47:32,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 23:47:32,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 23:47:32,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 23:47:32,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 23:47:32,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 23:47:32,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 23:47:32,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 23:47:32,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 23:47:32,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 23:47:32,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 23:47:32,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 23:47:32,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 23:47:32,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 23:47:32,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 23:47:32,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 23:47:32,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-17 23:47:33,013 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 23:47:33,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 23:47:33,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 23:47:33,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 23:47:33,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 23:47:33,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 23:47:33,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 23:47:33,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 23:47:33,016 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 23:47:33,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 23:47:33,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 23:47:33,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 23:47:33,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 23:47:33,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 23:47:33,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 23:47:33,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 23:47:33,017 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 23:47:33,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 23:47:33,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 23:47:33,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 23:47:33,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 23:47:33,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:47:33,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 23:47:33,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 23:47:33,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 23:47:33,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 23:47:33,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 23:47:33,019 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 23:47:33,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 23:47:33,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 23:47:33,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 23:47:33,019 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 -> c2c8100e1f648cee1922c84a2421989bafb670d4445ddc160c17e3cd878eaa49 [2021-12-17 23:47:33,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 23:47:33,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 23:47:33,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 23:47:33,200 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 23:47:33,201 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 23:47:33,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i [2021-12-17 23:47:33,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e121664ee/cf7c2bcdc78b4ed98c80fd7152dc0906/FLAG4e7526942 [2021-12-17 23:47:33,989 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 23:47:33,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i [2021-12-17 23:47:34,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e121664ee/cf7c2bcdc78b4ed98c80fd7152dc0906/FLAG4e7526942 [2021-12-17 23:47:34,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e121664ee/cf7c2bcdc78b4ed98c80fd7152dc0906 [2021-12-17 23:47:34,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 23:47:34,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 23:47:34,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 23:47:34,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 23:47:34,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 23:47:34,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:47:34" (1/1) ... [2021-12-17 23:47:34,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bf0bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:34, skipping insertion in model container [2021-12-17 23:47:34,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:47:34" (1/1) ... [2021-12-17 23:47:34,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 23:47:34,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 23:47:34,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i[4495,4508] [2021-12-17 23:47:34,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i[4555,4568] [2021-12-17 23:47:35,069 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,070 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,070 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,071 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,072 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,079 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,095 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,096 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,097 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,305 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-17 23:47:35,306 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-17 23:47:35,306 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-17 23:47:35,307 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-17 23:47:35,308 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-17 23:47:35,308 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-17 23:47:35,309 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-17 23:47:35,309 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-17 23:47:35,309 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-17 23:47:35,310 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-17 23:47:35,426 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-17 23:47:35,464 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:47:35,624 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 23:47:35,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i[4495,4508] [2021-12-17 23:47:35,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_harness.i[4555,4568] [2021-12-17 23:47:35,667 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,667 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,667 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,668 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,668 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,672 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,672 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,673 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,673 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,709 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-17 23:47:35,710 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-17 23:47:35,711 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-17 23:47:35,711 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-17 23:47:35,712 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-17 23:47:35,712 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-17 23:47:35,713 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-17 23:47:35,713 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-17 23:47:35,713 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-17 23:47:35,713 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-17 23:47:35,738 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-17 23:47:35,779 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:47:35,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:47:35,959 INFO L208 MainTranslator]: Completed translation [2021-12-17 23:47:35,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35 WrapperNode [2021-12-17 23:47:35,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 23:47:35,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 23:47:35,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 23:47:35,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 23:47:35,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,104 INFO L137 Inliner]: procedures = 691, calls = 2502, calls flagged for inlining = 53, calls inlined = 4, statements flattened = 753 [2021-12-17 23:47:36,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 23:47:36,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 23:47:36,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 23:47:36,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 23:47:36,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 23:47:36,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 23:47:36,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 23:47:36,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 23:47:36,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (1/1) ... [2021-12-17 23:47:36,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:47:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:36,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 23:47:36,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 23:47:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_clean_up [2021-12-17 23:47:36,255 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_clean_up [2021-12-17 23:47:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-17 23:47:36,255 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-17 23:47:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 23:47:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-17 23:47:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-17 23:47:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 23:47:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 23:47:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 23:47:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 23:47:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 23:47:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 23:47:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 23:47:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 23:47:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-17 23:47:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-17 23:47:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2021-12-17 23:47:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2021-12-17 23:47:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 23:47:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 23:47:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 23:47:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 23:47:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 23:47:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-17 23:47:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-17 23:47:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 23:47:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 23:47:36,389 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 23:47:36,390 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 23:47:36,911 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 23:47:36,918 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 23:47:36,918 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 23:47:36,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:47:36 BoogieIcfgContainer [2021-12-17 23:47:36,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 23:47:36,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 23:47:36,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 23:47:36,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 23:47:36,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:47:34" (1/3) ... [2021-12-17 23:47:36,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38971948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:47:36, skipping insertion in model container [2021-12-17 23:47:36,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:47:35" (2/3) ... [2021-12-17 23:47:36,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38971948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:47:36, skipping insertion in model container [2021-12-17 23:47:36,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:47:36" (3/3) ... [2021-12-17 23:47:36,926 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_clean_up_harness.i [2021-12-17 23:47:36,929 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 23:47:36,929 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 23:47:36,967 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 23:47:36,972 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 23:47:36,973 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 23:47:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-17 23:47:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 23:47:36,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:36,997 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:36,997 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:37,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash 877800461, now seen corresponding path program 1 times [2021-12-17 23:47:37,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:37,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443497951] [2021-12-17 23:47:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:37,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-17 23:47:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 23:47:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 23:47:37,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:37,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443497951] [2021-12-17 23:47:37,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443497951] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:37,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:37,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:47:37,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450601964] [2021-12-17 23:47:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:37,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:47:37,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:47:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:47:37,567 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 23:47:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:37,751 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2021-12-17 23:47:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 23:47:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2021-12-17 23:47:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:37,759 INFO L225 Difference]: With dead ends: 158 [2021-12-17 23:47:37,759 INFO L226 Difference]: Without dead ends: 85 [2021-12-17 23:47:37,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:47:37,763 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:37,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 111 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:47:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-17 23:47:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2021-12-17 23:47:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 23:47:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2021-12-17 23:47:37,788 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 56 [2021-12-17 23:47:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:37,788 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2021-12-17 23:47:37,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 23:47:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2021-12-17 23:47:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 23:47:37,790 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:37,790 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:37,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 23:47:37,791 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1602789575, now seen corresponding path program 1 times [2021-12-17 23:47:37,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186894705] [2021-12-17 23:47:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:37,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-17 23:47:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 23:47:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 23:47:38,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186894705] [2021-12-17 23:47:38,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186894705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147175541] [2021-12-17 23:47:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:38,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:38,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:38,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:38,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 23:47:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:38,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 2477 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 23:47:38,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 23:47:38,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:47:38,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147175541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:38,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:47:38,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-17 23:47:38,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724203521] [2021-12-17 23:47:38,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:38,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:47:38,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:38,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:47:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:47:38,554 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 23:47:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:38,620 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2021-12-17 23:47:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:47:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2021-12-17 23:47:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:38,622 INFO L225 Difference]: With dead ends: 139 [2021-12-17 23:47:38,622 INFO L226 Difference]: Without dead ends: 82 [2021-12-17 23:47:38,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:47:38,623 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 116 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:38,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 225 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:47:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-17 23:47:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-17 23:47:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 58 states have internal predecessors, (68), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2021-12-17 23:47:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-17 23:47:38,631 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 56 [2021-12-17 23:47:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:38,631 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-17 23:47:38,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 23:47:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-17 23:47:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-17 23:47:38,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:38,633 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:38,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 23:47:38,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:38,852 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash -737763694, now seen corresponding path program 1 times [2021-12-17 23:47:38,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:38,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862125241] [2021-12-17 23:47:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:38,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:38,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 23:47:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 23:47:39,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:39,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862125241] [2021-12-17 23:47:39,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862125241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:39,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453538608] [2021-12-17 23:47:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:39,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:39,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:39,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:39,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 23:47:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:39,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 2494 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 23:47:39,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 23:47:39,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:47:39,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453538608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:39,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:47:39,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2021-12-17 23:47:39,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695419574] [2021-12-17 23:47:39,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:39,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:47:39,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:39,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:47:39,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-12-17 23:47:39,721 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 23:47:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:39,905 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2021-12-17 23:47:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:47:39,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 62 [2021-12-17 23:47:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:39,906 INFO L225 Difference]: With dead ends: 105 [2021-12-17 23:47:39,906 INFO L226 Difference]: Without dead ends: 79 [2021-12-17 23:47:39,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-12-17 23:47:39,907 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 140 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:39,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 398 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:47:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-17 23:47:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-17 23:47:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 23:47:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2021-12-17 23:47:39,913 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 62 [2021-12-17 23:47:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:39,914 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2021-12-17 23:47:39,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 23:47:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2021-12-17 23:47:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 23:47:39,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:39,921 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:39,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 23:47:40,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-17 23:47:40,129 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash -218893667, now seen corresponding path program 1 times [2021-12-17 23:47:40,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:40,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827923839] [2021-12-17 23:47:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:40,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 23:47:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 23:47:40,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:40,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827923839] [2021-12-17 23:47:40,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827923839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:40,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:40,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 23:47:40,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469768162] [2021-12-17 23:47:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:40,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 23:47:40,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:40,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 23:47:40,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:47:40,731 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 23:47:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:41,465 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2021-12-17 23:47:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 23:47:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 68 [2021-12-17 23:47:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:41,467 INFO L225 Difference]: With dead ends: 111 [2021-12-17 23:47:41,467 INFO L226 Difference]: Without dead ends: 97 [2021-12-17 23:47:41,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-12-17 23:47:41,468 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 121 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:41,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 164 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 23:47:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-17 23:47:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2021-12-17 23:47:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2021-12-17 23:47:41,484 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 68 [2021-12-17 23:47:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:41,486 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2021-12-17 23:47:41,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 23:47:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2021-12-17 23:47:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 23:47:41,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:41,499 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:41,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 23:47:41,500 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -611920677, now seen corresponding path program 1 times [2021-12-17 23:47:41,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40522865] [2021-12-17 23:47:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:41,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 23:47:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 23:47:41,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:41,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40522865] [2021-12-17 23:47:41,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40522865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:41,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:41,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-17 23:47:41,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325368315] [2021-12-17 23:47:41,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:41,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 23:47:41,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 23:47:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:47:41,946 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 23:47:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:42,495 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2021-12-17 23:47:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 23:47:42,496 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 68 [2021-12-17 23:47:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:42,497 INFO L225 Difference]: With dead ends: 103 [2021-12-17 23:47:42,497 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 23:47:42,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-12-17 23:47:42,498 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:42,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 276 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:47:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 23:47:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2021-12-17 23:47:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2021-12-17 23:47:42,505 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 68 [2021-12-17 23:47:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:42,506 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2021-12-17 23:47:42,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 23:47:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2021-12-17 23:47:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-17 23:47:42,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:42,507 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:42,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 23:47:42,508 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 694437937, now seen corresponding path program 1 times [2021-12-17 23:47:42,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046683110] [2021-12-17 23:47:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:42,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 23:47:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:47:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:47:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-17 23:47:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 23:47:43,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:43,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046683110] [2021-12-17 23:47:43,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046683110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:43,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:43,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-17 23:47:43,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88612460] [2021-12-17 23:47:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:43,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 23:47:43,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 23:47:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:47:43,024 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-17 23:47:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:43,863 INFO L93 Difference]: Finished difference Result 190 states and 236 transitions. [2021-12-17 23:47:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 23:47:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 79 [2021-12-17 23:47:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:43,865 INFO L225 Difference]: With dead ends: 190 [2021-12-17 23:47:43,865 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 23:47:43,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-12-17 23:47:43,868 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 192 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:43,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 272 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 23:47:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 23:47:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2021-12-17 23:47:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2021-12-17 23:47:43,877 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 79 [2021-12-17 23:47:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:43,878 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2021-12-17 23:47:43,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-17 23:47:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2021-12-17 23:47:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-17 23:47:43,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:43,879 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:43,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 23:47:43,880 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -917468526, now seen corresponding path program 1 times [2021-12-17 23:47:43,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261131996] [2021-12-17 23:47:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:43,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 23:47:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 23:47:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 23:47:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 23:47:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 23:47:44,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:44,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261131996] [2021-12-17 23:47:44,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261131996] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:44,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131831907] [2021-12-17 23:47:44,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:44,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:44,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:44,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:44,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 23:47:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:44,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 2543 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 23:47:44,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 23:47:44,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:47:44,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131831907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:44,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:47:44,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2021-12-17 23:47:44,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670007634] [2021-12-17 23:47:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:44,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 23:47:44,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 23:47:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:47:44,938 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 23:47:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:45,040 INFO L93 Difference]: Finished difference Result 177 states and 224 transitions. [2021-12-17 23:47:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:47:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2021-12-17 23:47:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:45,041 INFO L225 Difference]: With dead ends: 177 [2021-12-17 23:47:45,042 INFO L226 Difference]: Without dead ends: 109 [2021-12-17 23:47:45,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:47:45,042 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 38 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:45,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 327 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2021-12-17 23:47:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-17 23:47:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2021-12-17 23:47:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2021-12-17 23:47:45,055 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 82 [2021-12-17 23:47:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:45,056 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2021-12-17 23:47:45,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 23:47:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2021-12-17 23:47:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-17 23:47:45,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:45,058 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:45,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 23:47:45,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:45,276 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash -401823171, now seen corresponding path program 1 times [2021-12-17 23:47:45,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:45,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034346031] [2021-12-17 23:47:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:45,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 23:47:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:47:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 23:47:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 23:47:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 23:47:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 23:47:45,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:45,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034346031] [2021-12-17 23:47:45,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034346031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:45,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418527824] [2021-12-17 23:47:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:45,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:45,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:45,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:45,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 23:47:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:45,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 2551 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-17 23:47:45,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:46,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:47:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 23:47:46,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:47:46,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2021-12-17 23:47:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-17 23:47:46,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418527824] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:46,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:47:46,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 11] total 25 [2021-12-17 23:47:46,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931139661] [2021-12-17 23:47:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:46,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:47:46,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:47:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2021-12-17 23:47:46,730 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 23:47:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:46,995 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2021-12-17 23:47:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 23:47:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 87 [2021-12-17 23:47:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:46,997 INFO L225 Difference]: With dead ends: 121 [2021-12-17 23:47:46,997 INFO L226 Difference]: Without dead ends: 100 [2021-12-17 23:47:46,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2021-12-17 23:47:46,998 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 67 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:46,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 178 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:47:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-17 23:47:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-17 23:47:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 72 states have internal predecessors, (80), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2021-12-17 23:47:47,004 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 87 [2021-12-17 23:47:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:47,004 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2021-12-17 23:47:47,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 23:47:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2021-12-17 23:47:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-17 23:47:47,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:47,010 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:47,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 23:47:47,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:47,211 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -18817266, now seen corresponding path program 1 times [2021-12-17 23:47:47,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:47,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963733388] [2021-12-17 23:47:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:47,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 23:47:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 23:47:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 23:47:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 23:47:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 23:47:47,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963733388] [2021-12-17 23:47:47,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963733388] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:47,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509381919] [2021-12-17 23:47:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:47,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:47,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:47,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 23:47:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:47,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 2533 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-17 23:47:47,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:48,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:47:48,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 23:47:48,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 23:47:48,546 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:47:48,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2021-12-17 23:47:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 23:47:48,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:47:48,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509381919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:48,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:47:48,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [11] total 27 [2021-12-17 23:47:48,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512641315] [2021-12-17 23:47:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:48,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 23:47:48,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 23:47:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2021-12-17 23:47:48,631 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 19 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-17 23:47:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:48,777 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2021-12-17 23:47:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 23:47:48,778 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 82 [2021-12-17 23:47:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:48,779 INFO L225 Difference]: With dead ends: 193 [2021-12-17 23:47:48,779 INFO L226 Difference]: Without dead ends: 115 [2021-12-17 23:47:48,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2021-12-17 23:47:48,780 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:48,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 999 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2021-12-17 23:47:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-17 23:47:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-12-17 23:47:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 86 states have internal predecessors, (99), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 139 transitions. [2021-12-17 23:47:48,787 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 139 transitions. Word has length 82 [2021-12-17 23:47:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:48,787 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 139 transitions. [2021-12-17 23:47:48,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-17 23:47:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 139 transitions. [2021-12-17 23:47:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-17 23:47:48,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:48,788 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:48,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 23:47:49,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:49,008 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1738210753, now seen corresponding path program 1 times [2021-12-17 23:47:49,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:49,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237684882] [2021-12-17 23:47:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:49,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 23:47:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:47:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 23:47:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 23:47:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 23:47:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 23:47:49,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237684882] [2021-12-17 23:47:49,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237684882] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618310287] [2021-12-17 23:47:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:49,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:49,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:49,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 23:47:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:49,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 2548 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 23:47:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 23:47:49,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:47:49,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618310287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:49,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:47:49,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-17 23:47:49,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435954899] [2021-12-17 23:47:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:49,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:47:49,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:47:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:47:49,718 INFO L87 Difference]: Start difference. First operand 115 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 23:47:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:49,735 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-12-17 23:47:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:47:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2021-12-17 23:47:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:49,736 INFO L225 Difference]: With dead ends: 217 [2021-12-17 23:47:49,736 INFO L226 Difference]: Without dead ends: 139 [2021-12-17 23:47:49,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:47:49,737 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 29 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:49,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 297 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:47:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-17 23:47:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2021-12-17 23:47:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 86 states have internal predecessors, (97), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2021-12-17 23:47:49,743 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 87 [2021-12-17 23:47:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:49,743 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2021-12-17 23:47:49,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 23:47:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2021-12-17 23:47:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-17 23:47:49,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:49,744 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:49,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 23:47:49,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:49,960 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 926780756, now seen corresponding path program 1 times [2021-12-17 23:47:49,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:49,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985786806] [2021-12-17 23:47:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:49,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 23:47:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 23:47:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 23:47:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 23:47:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 23:47:50,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985786806] [2021-12-17 23:47:50,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985786806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122045467] [2021-12-17 23:47:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:50,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:50,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:50,349 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:50,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 23:47:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:50,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-17 23:47:50,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 23:47:51,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:47:51,713 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-17 23:47:51,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-12-17 23:47:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 23:47:51,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122045467] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:47:51,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:47:51,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 33 [2021-12-17 23:47:51,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121582121] [2021-12-17 23:47:51,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:47:51,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-17 23:47:51,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-17 23:47:51,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 23:47:51,736 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 33 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 28 states have internal predecessors, (115), 10 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2021-12-17 23:47:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:54,108 INFO L93 Difference]: Finished difference Result 228 states and 299 transitions. [2021-12-17 23:47:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-17 23:47:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 28 states have internal predecessors, (115), 10 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 82 [2021-12-17 23:47:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:54,110 INFO L225 Difference]: With dead ends: 228 [2021-12-17 23:47:54,110 INFO L226 Difference]: Without dead ends: 179 [2021-12-17 23:47:54,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2021-12-17 23:47:54,111 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 409 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:54,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 619 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2177 Invalid, 0 Unknown, 165 Unchecked, 1.3s Time] [2021-12-17 23:47:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-17 23:47:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2021-12-17 23:47:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 110 states have internal predecessors, (120), 26 states have call successors, (26), 11 states have call predecessors, (26), 15 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2021-12-17 23:47:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2021-12-17 23:47:54,119 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 82 [2021-12-17 23:47:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:54,120 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2021-12-17 23:47:54,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 28 states have internal predecessors, (115), 10 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2021-12-17 23:47:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2021-12-17 23:47:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-17 23:47:54,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:54,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:54,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-17 23:47:54,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:54,332 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -670930472, now seen corresponding path program 1 times [2021-12-17 23:47:54,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082659394] [2021-12-17 23:47:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:54,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-17 23:47:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 23:47:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 23:47:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-17 23:47:54,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:54,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082659394] [2021-12-17 23:47:54,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082659394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:54,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:54,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 23:47:54,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415878951] [2021-12-17 23:47:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:54,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:47:54,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:47:54,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:47:54,456 INFO L87 Difference]: Start difference. First operand 147 states and 181 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 23:47:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:54,654 INFO L93 Difference]: Finished difference Result 242 states and 296 transitions. [2021-12-17 23:47:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:47:54,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2021-12-17 23:47:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:54,655 INFO L225 Difference]: With dead ends: 242 [2021-12-17 23:47:54,655 INFO L226 Difference]: Without dead ends: 118 [2021-12-17 23:47:54,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:47:54,656 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 107 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:54,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 182 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:47:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-17 23:47:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2021-12-17 23:47:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 75 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 12 states have return successors, (22), 18 states have call predecessors, (22), 19 states have call successors, (22) [2021-12-17 23:47:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2021-12-17 23:47:54,662 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 86 [2021-12-17 23:47:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:54,662 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-12-17 23:47:54,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 23:47:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2021-12-17 23:47:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-17 23:47:54,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:54,663 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:54,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 23:47:54,663 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash -937545844, now seen corresponding path program 1 times [2021-12-17 23:47:54,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675774333] [2021-12-17 23:47:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:54,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 23:47:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 23:47:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 23:47:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 23:47:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:47:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 23:47:54,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:54,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675774333] [2021-12-17 23:47:54,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675774333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:47:54,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815570402] [2021-12-17 23:47:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:54,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:47:54,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:47:54,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:47:54,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 23:47:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 23:47:55,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:47:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 23:47:55,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:47:55,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815570402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:55,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:47:55,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2021-12-17 23:47:55,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978714379] [2021-12-17 23:47:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:55,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 23:47:55,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 23:47:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:47:55,361 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 23:47:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:55,425 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2021-12-17 23:47:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:47:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2021-12-17 23:47:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:55,426 INFO L225 Difference]: With dead ends: 177 [2021-12-17 23:47:55,426 INFO L226 Difference]: Without dead ends: 99 [2021-12-17 23:47:55,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:47:55,426 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 11 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:55,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 634 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:47:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-17 23:47:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-12-17 23:47:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 70 states have internal predecessors, (73), 20 states have call successors, (20), 10 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 23:47:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-12-17 23:47:55,431 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 89 [2021-12-17 23:47:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:55,431 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-12-17 23:47:55,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 23:47:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-12-17 23:47:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 23:47:55,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:55,432 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:55,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 23:47:55,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 23:47:55,651 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1492874321, now seen corresponding path program 1 times [2021-12-17 23:47:55,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514019076] [2021-12-17 23:47:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:55,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:47:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 23:47:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 23:47:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:47:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 23:47:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 23:47:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:47:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-17 23:47:56,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:56,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514019076] [2021-12-17 23:47:56,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514019076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:56,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:56,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-17 23:47:56,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600743159] [2021-12-17 23:47:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:56,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 23:47:56,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 23:47:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-12-17 23:47:56,148 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-17 23:47:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:56,933 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2021-12-17 23:47:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 23:47:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 91 [2021-12-17 23:47:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:56,935 INFO L225 Difference]: With dead ends: 132 [2021-12-17 23:47:56,935 INFO L226 Difference]: Without dead ends: 105 [2021-12-17 23:47:56,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2021-12-17 23:47:56,935 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 175 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:56,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 202 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 23:47:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-17 23:47:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2021-12-17 23:47:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 70 states have internal predecessors, (72), 20 states have call successors, (20), 10 states have call predecessors, (20), 11 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:47:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-17 23:47:56,941 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 91 [2021-12-17 23:47:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:56,941 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-17 23:47:56,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-17 23:47:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-17 23:47:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-17 23:47:56,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:56,942 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:56,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 23:47:56,943 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:56,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash -19715100, now seen corresponding path program 1 times [2021-12-17 23:47:56,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:56,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252565012] [2021-12-17 23:47:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:56,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-17 23:47:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 23:47:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 23:47:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-17 23:47:57,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:57,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252565012] [2021-12-17 23:47:57,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252565012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:57,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:57,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 23:47:57,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20635664] [2021-12-17 23:47:57,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:57,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 23:47:57,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 23:47:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:47:57,299 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 23:47:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:57,766 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-12-17 23:47:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 23:47:57,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 86 [2021-12-17 23:47:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:57,767 INFO L225 Difference]: With dead ends: 111 [2021-12-17 23:47:57,767 INFO L226 Difference]: Without dead ends: 109 [2021-12-17 23:47:57,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-12-17 23:47:57,768 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:57,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 254 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:47:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-17 23:47:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2021-12-17 23:47:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 73 states have internal predecessors, (75), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:47:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2021-12-17 23:47:57,775 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 86 [2021-12-17 23:47:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:57,776 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2021-12-17 23:47:57,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 23:47:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2021-12-17 23:47:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-17 23:47:57,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:57,777 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:57,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 23:47:57,778 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:57,778 INFO L85 PathProgramCache]: Analyzing trace with hash -449956535, now seen corresponding path program 1 times [2021-12-17 23:47:57,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:57,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047552288] [2021-12-17 23:47:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:57,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-17 23:47:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:57,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 23:47:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 23:47:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-17 23:47:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-17 23:47:58,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:58,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047552288] [2021-12-17 23:47:58,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047552288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:58,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:58,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:47:58,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993300934] [2021-12-17 23:47:58,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:58,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:47:58,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:58,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:47:58,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:47:58,019 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 23:47:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:58,415 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-12-17 23:47:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:47:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2021-12-17 23:47:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:58,417 INFO L225 Difference]: With dead ends: 115 [2021-12-17 23:47:58,417 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 23:47:58,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-12-17 23:47:58,418 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 97 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:58,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 243 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 23:47:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 23:47:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2021-12-17 23:47:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-17 23:47:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-12-17 23:47:58,423 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 92 [2021-12-17 23:47:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:58,424 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-12-17 23:47:58,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 23:47:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-12-17 23:47:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-17 23:47:58,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:47:58,425 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:47:58,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 23:47:58,425 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:47:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:47:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1438296044, now seen corresponding path program 1 times [2021-12-17 23:47:58,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:47:58,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597899011] [2021-12-17 23:47:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:47:58,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:47:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:47:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 23:47:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 23:47:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 23:47:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-17 23:47:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:47:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 23:47:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 23:47:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-17 23:47:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-17 23:47:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:47:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-17 23:47:58,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:47:58,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597899011] [2021-12-17 23:47:58,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597899011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:47:58,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:47:58,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 23:47:58,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013804482] [2021-12-17 23:47:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:47:58,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 23:47:58,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:47:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 23:47:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:47:58,879 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-17 23:47:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:47:59,405 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-17 23:47:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 23:47:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 98 [2021-12-17 23:47:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:47:59,406 INFO L225 Difference]: With dead ends: 111 [2021-12-17 23:47:59,406 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 23:47:59,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-12-17 23:47:59,407 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 94 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:47:59,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 260 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:47:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 23:47:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 23:47:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 23:47:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 23:47:59,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2021-12-17 23:47:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:47:59,408 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 23:47:59,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-17 23:47:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 23:47:59,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 23:47:59,410 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 23:47:59,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 23:47:59,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 23:48:00,681 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (not (= 195 |~#s_can_fail_allocator_static~0.base|)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-17 23:48:00,682 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2021-12-17 23:48:00,683 INFO L858 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2021-12-17 23:48:00,683 INFO L854 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= bounded_malloc_~size |bounded_malloc_#in~size|)) (not (< 0 |#StackHeapBarrier|)) (not (= 195 |~#s_can_fail_allocator_static~0.base|))) [2021-12-17 23:48:00,683 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2021-12-17 23:48:00,683 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7179 7185) the Hoare annotation is: true [2021-12-17 23:48:00,683 INFO L858 garLoopResultBuilder]: For program point L7181-3(line 7181) no Hoare annotation was computed. [2021-12-17 23:48:00,683 INFO L858 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7181(lines 7181 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7181-7(lines 7181 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7181-6(lines 7181 7182) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7181-4(lines 7181 7182) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7181-11(lines 7181 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7181-9(lines 7181 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7179 7185) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7179 7185) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7184-2(line 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,684 INFO L858 garLoopResultBuilder]: For program point L7184(line 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point L7184-6(line 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point L7184-4(line 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point L7184-3(line 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point L7184-8(line 7184) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-17 23:48:00,685 INFO L858 garLoopResultBuilder]: For program point L7056-1(lines 7056 7058) no Hoare annotation was computed. [2021-12-17 23:48:00,685 INFO L854 garLoopResultBuilder]: At program point L7056(lines 7056 7058) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (< 0 |#StackHeapBarrier|))) [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7055 7068) no Hoare annotation was computed. [2021-12-17 23:48:00,686 INFO L854 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7055 7068) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (< 0 |#StackHeapBarrier|))) [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point L7063(lines 7063 7067) no Hoare annotation was computed. [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point L7059-1(lines 7059 7061) no Hoare annotation was computed. [2021-12-17 23:48:00,686 INFO L854 garLoopResultBuilder]: At program point L7059(lines 7059 7061) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (< 0 |#StackHeapBarrier|))) [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point L7063-2(lines 7055 7068) no Hoare annotation was computed. [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-17 23:48:00,686 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-17 23:48:00,686 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-17 23:48:00,687 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2021-12-17 23:48:00,687 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2021-12-17 23:48:00,687 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2021-12-17 23:48:00,687 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 23:48:00,687 INFO L858 garLoopResultBuilder]: For program point L8770-1(lines 8770 8772) no Hoare annotation was computed. [2021-12-17 23:48:00,687 INFO L858 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2021-12-17 23:48:00,688 INFO L854 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24))) (let ((.cse0 (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse1 (= 195 |~#s_can_fail_allocator_static~0.base|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse3 (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0)) (.cse6 (< 0 |#StackHeapBarrier|)) (.cse7 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_#t~mem475#1| (select (select |#memory_int| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 16)))) (.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 (= 195 .cse4) .cse5 .cse6 .cse7) (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse8) 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= .cse4 0))))) [2021-12-17 23:48:00,688 INFO L861 garLoopResultBuilder]: At program point L8779(line 8779) the Hoare annotation is: true [2021-12-17 23:48:00,688 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-12-17 23:48:00,688 INFO L854 garLoopResultBuilder]: At program point L8773(lines 8773 8775) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8))) (and (= (select .cse0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24)) 0) (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1152#1.base|) (= 195 |~#s_can_fail_allocator_static~0.base|) (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1152#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= (select .cse0 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 16)) 0) (< 0 |#StackHeapBarrier|) (= (select .cse1 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 24)) 0) (= (select .cse1 .cse2) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) .cse2) 0))) [2021-12-17 23:48:00,688 INFO L858 garLoopResultBuilder]: For program point L8773-1(lines 8773 8775) no Hoare annotation was computed. [2021-12-17 23:48:00,688 INFO L854 garLoopResultBuilder]: At program point L8777(line 8777) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8))) (and (= (select .cse0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24)) 0) (= 195 |~#s_can_fail_allocator_static~0.base|) (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1154#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1154#1|) (= (select .cse0 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 16)) 0) (< 0 |#StackHeapBarrier|) (= (select .cse1 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 24)) 0) (= (select .cse1 .cse2) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) .cse2) 0))) [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point L8777-1(line 8777) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point L8767-2(line 8767) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point L8763(lines 8763 8778) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L854 garLoopResultBuilder]: At program point L8769(line 8769) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24))) (let ((.cse0 (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (= 195 |~#s_can_fail_allocator_static~0.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8)) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse5 (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse1)) (.cse6 (not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 16)) 18446744073709551616)))) (.cse7 (< 0 |#StackHeapBarrier|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= .cse9 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 (= 195 .cse9) .cse6 .cse7 .cse8)))) [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L858 garLoopResultBuilder]: For program point L8769-1(line 8769) no Hoare annotation was computed. [2021-12-17 23:48:00,689 INFO L854 garLoopResultBuilder]: At program point L8767(line 8767) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24))) (let ((.cse0 (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (= 195 |~#s_can_fail_allocator_static~0.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8)) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse5 (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse1)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0)) (.cse7 (< 0 |#StackHeapBarrier|)) (.cse8 (<= (mod (select (select |#memory_int| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 16)) 18446744073709551616) 36028797018963967))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= .cse9 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 (= 195 .cse9) .cse6 .cse7 .cse8)))) [2021-12-17 23:48:00,690 INFO L854 garLoopResultBuilder]: At program point L8767-1(line 8767) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24))) (let ((.cse0 (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (= 195 |~#s_can_fail_allocator_static~0.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8)) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse1)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0)) (.cse7 (not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 16)) 18446744073709551616)))) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) .cse1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= .cse9 0)) (and .cse0 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~ret1150#1| 0) .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse5 (= 195 .cse9) .cse6 .cse7 .cse8)))) [2021-12-17 23:48:00,690 INFO L854 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= 195 |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2021-12-17 23:48:00,690 INFO L858 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2021-12-17 23:48:00,690 INFO L854 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= 195 |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2021-12-17 23:48:00,690 INFO L858 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2021-12-17 23:48:00,690 INFO L858 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2021-12-17 23:48:00,690 INFO L854 garLoopResultBuilder]: At program point L8770(lines 8770 8772) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8))) (and (= (select .cse0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24)) 0) (= 195 |~#s_can_fail_allocator_static~0.base|) (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1151#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1151#1.offset|) (= (select .cse0 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 16)) 0) (< 0 |#StackHeapBarrier|) (= (select .cse1 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 24)) 0) (= (select .cse1 .cse2) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) .cse2) 0))) [2021-12-17 23:48:00,691 INFO L854 garLoopResultBuilder]: At program point L8776(line 8776) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 8))) (and (= (select .cse0 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 24)) 0) (= 195 |~#s_can_fail_allocator_static~0.base|) (= 0 |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1153#1| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (< 1 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= (select .cse0 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 16)) 0) (< 0 |#StackHeapBarrier|) (= (select .cse1 (+ |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 24)) 0) (= (select .cse1 .cse2) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) .cse2) 0))) [2021-12-17 23:48:00,691 INFO L858 garLoopResultBuilder]: For program point L8776-1(line 8776) no Hoare annotation was computed. [2021-12-17 23:48:00,691 INFO L854 garLoopResultBuilder]: At program point aws_byte_buf_clean_upENTRY(lines 7203 7216) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (not (= 195 |~#s_can_fail_allocator_static~0.base|)) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-17 23:48:00,692 INFO L858 garLoopResultBuilder]: For program point L7205-4(lines 7205 7207) no Hoare annotation was computed. [2021-12-17 23:48:00,692 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_clean_upFINAL(lines 7203 7216) no Hoare annotation was computed. [2021-12-17 23:48:00,692 INFO L854 garLoopResultBuilder]: At program point L7206(line 7206) the Hoare annotation is: (let ((.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |#valid| |old(#valid)|)) (.cse2 (= |#memory_real| |old(#memory_real)|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and .cse0 .cse1 (<= |aws_byte_buf_clean_up_#in~buf.base| 0) .cse2 .cse3 .cse4 (<= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base)) (not (< 0 |#StackHeapBarrier|)) (not (= 195 |~#s_can_fail_allocator_static~0.base|)) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (+ aws_byte_buf_clean_up_~buf.offset 24))) (or (not (= (select (select |#memory_$Pointer$.offset| aws_byte_buf_clean_up_~buf.base) .cse5) 0)) (not (= aws_byte_buf_clean_up_~buf.offset 0)) (not (= (select (select |#memory_$Pointer$.base| aws_byte_buf_clean_up_~buf.base) .cse5) 0)))) (= aws_byte_buf_clean_up_~buf.offset |aws_byte_buf_clean_up_#in~buf.offset|) (= aws_byte_buf_clean_up_~buf.base |aws_byte_buf_clean_up_#in~buf.base|) .cse4))) [2021-12-17 23:48:00,693 INFO L858 garLoopResultBuilder]: For program point L7204-2(line 7204) no Hoare annotation was computed. [2021-12-17 23:48:00,693 INFO L854 garLoopResultBuilder]: At program point L7204-1(line 7204) the Hoare annotation is: (let ((.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |#valid| |old(#valid)|)) (.cse2 (= |#memory_real| |old(#memory_real)|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and .cse0 .cse1 (<= |aws_byte_buf_clean_up_#in~buf.base| 0) .cse2 .cse3 .cse4 (<= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base)) (not (< 0 |#StackHeapBarrier|)) (and .cse0 .cse1 .cse2 .cse3 (= aws_byte_buf_clean_up_~buf.offset |aws_byte_buf_clean_up_#in~buf.offset|) (= aws_byte_buf_clean_up_~buf.base |aws_byte_buf_clean_up_#in~buf.base|) .cse4) (not (= 195 |~#s_can_fail_allocator_static~0.base|)))) [2021-12-17 23:48:00,693 INFO L858 garLoopResultBuilder]: For program point L7205-2(lines 7205 7207) no Hoare annotation was computed. [2021-12-17 23:48:00,693 INFO L854 garLoopResultBuilder]: At program point L7204(line 7204) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= aws_byte_buf_clean_up_~buf.offset |aws_byte_buf_clean_up_#in~buf.offset|) (= aws_byte_buf_clean_up_~buf.base |aws_byte_buf_clean_up_#in~buf.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 195 |~#s_can_fail_allocator_static~0.base|))) [2021-12-17 23:48:00,693 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_clean_upEXIT(lines 7203 7216) no Hoare annotation was computed. [2021-12-17 23:48:00,693 INFO L858 garLoopResultBuilder]: For program point L7205(line 7205) no Hoare annotation was computed. [2021-12-17 23:48:00,693 INFO L858 garLoopResultBuilder]: For program point L7206-1(line 7206) no Hoare annotation was computed. [2021-12-17 23:48:00,693 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-17 23:48:00,694 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-17 23:48:00,694 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-17 23:48:00,694 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-17 23:48:00,694 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-17 23:48:00,694 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-17 23:48:00,697 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:48:00,698 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 23:48:00,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:48:00 BoogieIcfgContainer [2021-12-17 23:48:00,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 23:48:00,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 23:48:00,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 23:48:00,707 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 23:48:00,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:47:36" (3/4) ... [2021-12-17 23:48:00,710 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 23:48:00,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-17 23:48:00,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-17 23:48:00,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-17 23:48:00,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2021-12-17 23:48:00,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-17 23:48:00,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_clean_up [2021-12-17 23:48:00,717 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-17 23:48:00,717 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-17 23:48:00,729 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 116 nodes and edges [2021-12-17 23:48:00,734 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-17 23:48:00,735 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-17 23:48:00,735 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-17 23:48:00,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-17 23:48:00,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 23:48:00,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 23:48:00,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 23:48:01,274 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 23:48:01,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 23:48:01,275 INFO L158 Benchmark]: Toolchain (without parser) took 27023.27ms. Allocated memory was 104.9MB in the beginning and 383.8MB in the end (delta: 278.9MB). Free memory was 68.5MB in the beginning and 99.6MB in the end (delta: -31.1MB). Peak memory consumption was 267.4MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,275 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 23:48:01,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1704.24ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.5MB in the beginning and 61.0MB in the end (delta: 7.5MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 146.39ms. Allocated memory is still 125.8MB. Free memory was 60.9MB in the beginning and 49.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,276 INFO L158 Benchmark]: Boogie Preprocessor took 71.13ms. Allocated memory is still 125.8MB. Free memory was 49.8MB in the beginning and 43.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,277 INFO L158 Benchmark]: RCFGBuilder took 740.93ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 43.5MB in the beginning and 121.5MB in the end (delta: -78.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,277 INFO L158 Benchmark]: TraceAbstraction took 23785.47ms. Allocated memory was 178.3MB in the beginning and 383.8MB in the end (delta: 205.5MB). Free memory was 120.6MB in the beginning and 256.0MB in the end (delta: -135.5MB). Peak memory consumption was 227.1MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,279 INFO L158 Benchmark]: Witness Printer took 567.84ms. Allocated memory is still 383.8MB. Free memory was 256.0MB in the beginning and 99.6MB in the end (delta: 156.4MB). Peak memory consumption was 176.4MB. Max. memory is 16.1GB. [2021-12-17 23:48:01,282 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1704.24ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.5MB in the beginning and 61.0MB in the end (delta: 7.5MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 146.39ms. Allocated memory is still 125.8MB. Free memory was 60.9MB in the beginning and 49.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.13ms. Allocated memory is still 125.8MB. Free memory was 49.8MB in the beginning and 43.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 740.93ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 43.5MB in the beginning and 121.5MB in the end (delta: -78.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23785.47ms. Allocated memory was 178.3MB in the beginning and 383.8MB in the end (delta: 205.5MB). Free memory was 120.6MB in the beginning and 256.0MB in the end (delta: -135.5MB). Peak memory consumption was 227.1MB. Max. memory is 16.1GB. * Witness Printer took 567.84ms. Allocated memory is still 383.8MB. Free memory was 256.0MB in the beginning and 99.6MB in the end (delta: 156.4MB). Peak memory consumption was 176.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1999 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1941 mSDsluCounter, 5641 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 290 IncrementalHoareTripleChecker+Unchecked, 4321 mSDsCounter, 849 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7440 IncrementalHoareTripleChecker+Invalid, 8579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 849 mSolverCounterUnsat, 1320 mSDtfsCounter, 7440 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1385 GetRequests, 1047 SyntacticMatches, 10 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 121 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 252 PreInvPairs, 400 NumberOfFragments, 1037 HoareAnnotationTreeSize, 252 FomulaSimplifications, 2255 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 25 FomulaSimplificationsInter, 3312 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1978 NumberOfCodeBlocks, 1978 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2120 ConstructedInterpolants, 39 QuantifiedInterpolants, 7439 SizeOfPredicates, 60 NumberOfNonLiveVariables, 20221 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 623/739 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8779]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-17 23:48:01,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE