./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_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_from_empty_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:15:20,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:15:20,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:15:20,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:15:20,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:15:20,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:15:20,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:15:20,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:15:20,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:15:20,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:15:20,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:15:20,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:15:20,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:15:20,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:15:20,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:15:20,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:15:20,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:15:20,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:15:20,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:15:20,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:15:20,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:15:20,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:15:20,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:15:20,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:15:20,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:15:20,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:15:20,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:15:20,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:15:20,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:15:20,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:15:20,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:15:20,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:15:20,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:15:20,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:15:20,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:15:20,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:15:20,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:15:20,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:15:20,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:15:20,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:15:20,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:15:20,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 03:15:20,233 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:15:20,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:15:20,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:15:20,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:15:20,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:15:20,238 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:15:20,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:15:20,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:15:20,239 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:15:20,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:15:20,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:15:20,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:15:20,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:15:20,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:15:20,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:15:20,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:15:20,247 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:15:20,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:15:20,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:15:20,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:15:20,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:15:20,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:15:20,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:15:20,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:15:20,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:15:20,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:15:20,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:15:20,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:15:20,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:15:20,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:15:20,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:15:20,250 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2021-12-16 03:15:20,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:15:20,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:15:20,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:15:20,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:15:20,563 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:15:20,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-12-16 03:15:20,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4208bcf0/2a92b1c78c7b479bb5f9924bb2b4eb7a/FLAG5a0d0f70b [2021-12-16 03:15:21,415 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:15:21,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-12-16 03:15:21,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4208bcf0/2a92b1c78c7b479bb5f9924bb2b4eb7a/FLAG5a0d0f70b [2021-12-16 03:15:21,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4208bcf0/2a92b1c78c7b479bb5f9924bb2b4eb7a [2021-12-16 03:15:21,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:15:21,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:15:21,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:15:21,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:15:21,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:15:21,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:15:21" (1/1) ... [2021-12-16 03:15:21,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325388a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:21, skipping insertion in model container [2021-12-16 03:15:21,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:15:21" (1/1) ... [2021-12-16 03:15:21,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:15:21,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:15:21,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-12-16 03:15:21,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-12-16 03:15:22,500 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,508 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,510 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,525 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,527 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,528 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:22,846 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:15:22,848 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:15:22,848 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:15:22,849 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:15:22,850 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:15:22,851 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:15:22,852 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:15:22,853 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:15:22,853 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:15:22,854 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:15:22,960 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:15:23,045 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,045 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:15:23,186 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:15:23,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-12-16 03:15:23,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-12-16 03:15:23,253 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,254 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,255 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,256 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,256 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,263 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,264 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,265 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,265 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,304 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:15:23,305 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:15:23,308 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:15:23,309 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:15:23,310 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:15:23,310 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:15:23,310 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:15:23,311 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:15:23,311 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:15:23,312 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:15:23,328 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:15:23,390 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,391 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:15:23,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:15:23,605 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:15:23,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23 WrapperNode [2021-12-16 03:15:23,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:15:23,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:15:23,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:15:23,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:15:23,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,773 INFO L137 Inliner]: procedures = 690, calls = 2614, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 794 [2021-12-16 03:15:23,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:15:23,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:15:23,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:15:23,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:15:23,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:15:23,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:15:23,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:15:23,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:15:23,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (1/1) ... [2021-12-16 03:15:23,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:15:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:23,902 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-16 03:15:23,931 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-16 03:15:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-16 03:15:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-16 03:15:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 03:15:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:15:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 03:15:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 03:15:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 03:15:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:15:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 03:15:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:15:23,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:15:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-16 03:15:23,949 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-16 03:15:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-16 03:15:23,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-16 03:15:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 03:15:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 03:15:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 03:15:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-16 03:15:23,950 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-16 03:15:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 03:15:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:15:24,205 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:15:24,215 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:15:24,807 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:15:24,813 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:15:24,814 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 03:15:24,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:15:24 BoogieIcfgContainer [2021-12-16 03:15:24,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:15:24,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:15:24,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:15:24,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:15:24,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:15:21" (1/3) ... [2021-12-16 03:15:24,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260bc5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:15:24, skipping insertion in model container [2021-12-16 03:15:24,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:15:23" (2/3) ... [2021-12-16 03:15:24,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260bc5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:15:24, skipping insertion in model container [2021-12-16 03:15:24,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:15:24" (3/3) ... [2021-12-16 03:15:24,826 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-12-16 03:15:24,830 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:15:24,830 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:15:24,878 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:15:24,888 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-16 03:15:24,889 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 03:15:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-16 03:15:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 03:15:24,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:24,922 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:24,922 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:24,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1597769755, now seen corresponding path program 1 times [2021-12-16 03:15:24,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:24,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171649995] [2021-12-16 03:15:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:24,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:25,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:25,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171649995] [2021-12-16 03:15:25,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171649995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:25,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:25,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 03:15:25,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809755337] [2021-12-16 03:15:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:25,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 03:15:25,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 03:15:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 03:15:25,582 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:25,748 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2021-12-16 03:15:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 03:15:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-16 03:15:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:25,761 INFO L225 Difference]: With dead ends: 137 [2021-12-16 03:15:25,763 INFO L226 Difference]: Without dead ends: 64 [2021-12-16 03:15:25,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 03:15:25,774 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:25,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 109 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-16 03:15:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-16 03:15:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-16 03:15:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2021-12-16 03:15:25,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 31 [2021-12-16 03:15:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:25,829 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2021-12-16 03:15:25,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2021-12-16 03:15:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 03:15:25,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:25,831 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:25,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:15:25,832 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:25,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1816677797, now seen corresponding path program 1 times [2021-12-16 03:15:25,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:25,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019546263] [2021-12-16 03:15:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:25,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:26,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:26,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019546263] [2021-12-16 03:15:26,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019546263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:26,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:26,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:15:26,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113426374] [2021-12-16 03:15:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:26,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:15:26,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:26,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:15:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:26,135 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:26,347 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2021-12-16 03:15:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:15:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-16 03:15:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:26,351 INFO L225 Difference]: With dead ends: 117 [2021-12-16 03:15:26,351 INFO L226 Difference]: Without dead ends: 67 [2021-12-16 03:15:26,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:26,354 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:26,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 163 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-16 03:15:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-16 03:15:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 48 states have internal predecessors, (55), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-12-16 03:15:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2021-12-16 03:15:26,377 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 31 [2021-12-16 03:15:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:26,377 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2021-12-16 03:15:26,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2021-12-16 03:15:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 03:15:26,380 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:26,380 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:26,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:15:26,380 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1185357712, now seen corresponding path program 1 times [2021-12-16 03:15:26,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:26,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549313625] [2021-12-16 03:15:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:26,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:26,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549313625] [2021-12-16 03:15:26,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549313625] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:26,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:26,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:26,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517911858] [2021-12-16 03:15:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:26,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:26,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:26,710 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:26,999 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2021-12-16 03:15:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-16 03:15:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:27,000 INFO L225 Difference]: With dead ends: 79 [2021-12-16 03:15:27,000 INFO L226 Difference]: Without dead ends: 77 [2021-12-16 03:15:27,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:27,001 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:27,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 359 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-16 03:15:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-12-16 03:15:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 55 states have internal predecessors, (61), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-16 03:15:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2021-12-16 03:15:27,009 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 37 [2021-12-16 03:15:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:27,009 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2021-12-16 03:15:27,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2021-12-16 03:15:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:27,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:27,011 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:27,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 03:15:27,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1529203256, now seen corresponding path program 1 times [2021-12-16 03:15:27,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:27,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601060552] [2021-12-16 03:15:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:27,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:27,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:27,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601060552] [2021-12-16 03:15:27,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601060552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:27,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:27,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:27,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690893441] [2021-12-16 03:15:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:27,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:27,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:27,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:27,325 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:27,725 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2021-12-16 03:15:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:27,727 INFO L225 Difference]: With dead ends: 145 [2021-12-16 03:15:27,727 INFO L226 Difference]: Without dead ends: 88 [2021-12-16 03:15:27,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:27,728 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:27,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 283 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-16 03:15:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2021-12-16 03:15:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-16 03:15:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2021-12-16 03:15:27,736 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 41 [2021-12-16 03:15:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:27,736 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2021-12-16 03:15:27,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2021-12-16 03:15:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:27,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:27,737 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:27,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:15:27,738 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1787368694, now seen corresponding path program 1 times [2021-12-16 03:15:27,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:27,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465011388] [2021-12-16 03:15:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:27,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:15:28,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465011388] [2021-12-16 03:15:28,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465011388] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:28,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832836397] [2021-12-16 03:15:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:28,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:28,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:28,755 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-16 03:15:28,757 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-16 03:15:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:29,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 2418 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 03:15:29,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:15:29,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:15:29,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:15:29,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-16 03:15:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:29,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:15:29,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832836397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:29,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:15:29,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2021-12-16 03:15:29,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944271505] [2021-12-16 03:15:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:29,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:29,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-12-16 03:15:29,864 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:29,930 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2021-12-16 03:15:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:29,934 INFO L225 Difference]: With dead ends: 173 [2021-12-16 03:15:29,936 INFO L226 Difference]: Without dead ends: 95 [2021-12-16 03:15:29,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-12-16 03:15:29,939 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 22 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:29,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 371 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2021-12-16 03:15:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-16 03:15:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2021-12-16 03:15:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 70 states have internal predecessors, (80), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-16 03:15:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2021-12-16 03:15:29,952 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 41 [2021-12-16 03:15:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:29,953 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2021-12-16 03:15:29,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2021-12-16 03:15:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:29,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:29,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:29,989 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-16 03:15:30,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:30,173 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash 199020792, now seen corresponding path program 1 times [2021-12-16 03:15:30,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:30,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705082313] [2021-12-16 03:15:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:30,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:30,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705082313] [2021-12-16 03:15:30,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705082313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:30,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:30,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:15:30,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142024744] [2021-12-16 03:15:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:30,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:15:30,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:15:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:15:30,332 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:30,509 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2021-12-16 03:15:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:15:30,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-16 03:15:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:30,511 INFO L225 Difference]: With dead ends: 199 [2021-12-16 03:15:30,511 INFO L226 Difference]: Without dead ends: 133 [2021-12-16 03:15:30,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:30,512 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:30,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 204 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-16 03:15:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2021-12-16 03:15:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-16 03:15:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2021-12-16 03:15:30,532 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 41 [2021-12-16 03:15:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:30,532 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2021-12-16 03:15:30,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2021-12-16 03:15:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:30,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:30,536 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:30,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:15:30,536 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:30,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1080842886, now seen corresponding path program 1 times [2021-12-16 03:15:30,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:30,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382122209] [2021-12-16 03:15:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:30,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:30,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:30,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382122209] [2021-12-16 03:15:30,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382122209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:30,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:30,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:15:30,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600377280] [2021-12-16 03:15:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:30,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:15:30,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:15:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:30,764 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:30,986 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2021-12-16 03:15:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:15:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-16 03:15:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:30,988 INFO L225 Difference]: With dead ends: 178 [2021-12-16 03:15:30,989 INFO L226 Difference]: Without dead ends: 115 [2021-12-16 03:15:30,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:30,990 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:30,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-16 03:15:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2021-12-16 03:15:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 79 states have internal predecessors, (89), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2021-12-16 03:15:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2021-12-16 03:15:30,999 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 41 [2021-12-16 03:15:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:31,000 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2021-12-16 03:15:31,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2021-12-16 03:15:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:31,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:31,001 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:31,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 03:15:31,002 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2006223412, now seen corresponding path program 1 times [2021-12-16 03:15:31,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:31,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316643481] [2021-12-16 03:15:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:31,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:31,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:31,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316643481] [2021-12-16 03:15:31,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316643481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:31,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:31,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:31,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601066386] [2021-12-16 03:15:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:31,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:31,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:31,361 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:31,873 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2021-12-16 03:15:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:31,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:31,875 INFO L225 Difference]: With dead ends: 200 [2021-12-16 03:15:31,875 INFO L226 Difference]: Without dead ends: 130 [2021-12-16 03:15:31,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:15:31,876 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 113 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:31,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 301 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-16 03:15:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2021-12-16 03:15:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 98 states have internal predecessors, (113), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-16 03:15:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2021-12-16 03:15:31,885 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 41 [2021-12-16 03:15:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:31,886 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2021-12-16 03:15:31,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2021-12-16 03:15:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 03:15:31,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:31,887 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:31,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 03:15:31,891 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash 726359734, now seen corresponding path program 1 times [2021-12-16 03:15:31,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:31,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756369641] [2021-12-16 03:15:31,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:31,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:32,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:32,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756369641] [2021-12-16 03:15:32,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756369641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:32,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:32,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:32,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962708648] [2021-12-16 03:15:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:32,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:32,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:32,123 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:32,511 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2021-12-16 03:15:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:15:32,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-16 03:15:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:32,515 INFO L225 Difference]: With dead ends: 230 [2021-12-16 03:15:32,515 INFO L226 Difference]: Without dead ends: 136 [2021-12-16 03:15:32,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-12-16 03:15:32,517 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 109 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:32,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 294 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-16 03:15:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2021-12-16 03:15:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.211111111111111) internal successors, (109), 95 states have internal predecessors, (109), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-16 03:15:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2021-12-16 03:15:32,530 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 41 [2021-12-16 03:15:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:32,530 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2021-12-16 03:15:32,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2021-12-16 03:15:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 03:15:32,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:32,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:32,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 03:15:32,535 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1315800189, now seen corresponding path program 1 times [2021-12-16 03:15:32,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:32,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253177361] [2021-12-16 03:15:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:32,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:32,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:32,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253177361] [2021-12-16 03:15:32,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253177361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:32,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:32,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 03:15:32,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397258879] [2021-12-16 03:15:32,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:32,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:32,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:32,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:32,765 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:33,089 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2021-12-16 03:15:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:15:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-16 03:15:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:33,092 INFO L225 Difference]: With dead ends: 145 [2021-12-16 03:15:33,092 INFO L226 Difference]: Without dead ends: 143 [2021-12-16 03:15:33,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-16 03:15:33,093 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:33,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 450 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-16 03:15:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2021-12-16 03:15:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 103 states have internal predecessors, (116), 16 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2021-12-16 03:15:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2021-12-16 03:15:33,102 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 43 [2021-12-16 03:15:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:33,102 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2021-12-16 03:15:33,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2021-12-16 03:15:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 03:15:33,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:33,104 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:33,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 03:15:33,104 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2016864767, now seen corresponding path program 1 times [2021-12-16 03:15:33,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:33,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601834098] [2021-12-16 03:15:33,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:33,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:33,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:33,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601834098] [2021-12-16 03:15:33,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601834098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:33,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:33,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:15:33,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519830304] [2021-12-16 03:15:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:33,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:15:33,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:15:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:33,409 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:34,025 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2021-12-16 03:15:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 03:15:34,025 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-16 03:15:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:34,026 INFO L225 Difference]: With dead ends: 153 [2021-12-16 03:15:34,026 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 03:15:34,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2021-12-16 03:15:34,027 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 114 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:34,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 553 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 03:15:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 117. [2021-12-16 03:15:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.2) internal successors, (108), 95 states have internal predecessors, (108), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-16 03:15:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-12-16 03:15:34,034 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 43 [2021-12-16 03:15:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:34,034 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-12-16 03:15:34,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 03:15:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-12-16 03:15:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 03:15:34,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:34,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:34,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 03:15:34,035 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1260426877, now seen corresponding path program 1 times [2021-12-16 03:15:34,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:34,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996249464] [2021-12-16 03:15:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:34,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:34,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:34,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996249464] [2021-12-16 03:15:34,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996249464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:34,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:34,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:34,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026257344] [2021-12-16 03:15:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:34,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:34,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:34,258 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:34,520 INFO L93 Difference]: Finished difference Result 224 states and 273 transitions. [2021-12-16 03:15:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:15:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-16 03:15:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:34,521 INFO L225 Difference]: With dead ends: 224 [2021-12-16 03:15:34,521 INFO L226 Difference]: Without dead ends: 133 [2021-12-16 03:15:34,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:34,522 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:34,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 256 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-16 03:15:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2021-12-16 03:15:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 89 states have internal predecessors, (103), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-16 03:15:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2021-12-16 03:15:34,528 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 43 [2021-12-16 03:15:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:34,528 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2021-12-16 03:15:34,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:15:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2021-12-16 03:15:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-16 03:15:34,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:34,529 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:34,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 03:15:34,529 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 707087091, now seen corresponding path program 1 times [2021-12-16 03:15:34,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:34,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213149948] [2021-12-16 03:15:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:34,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 03:15:34,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:34,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213149948] [2021-12-16 03:15:34,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213149948] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:34,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369818748] [2021-12-16 03:15:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:34,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:34,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:34,688 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-16 03:15:34,714 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-16 03:15:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 2456 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 03:15:35,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 03:15:35,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:15:35,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369818748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:35,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:15:35,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-16 03:15:35,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101212420] [2021-12-16 03:15:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:35,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:15:35,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:35,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:15:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:15:35,190 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:35,216 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2021-12-16 03:15:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:15:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2021-12-16 03:15:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:35,218 INFO L225 Difference]: With dead ends: 198 [2021-12-16 03:15:35,218 INFO L226 Difference]: Without dead ends: 114 [2021-12-16 03:15:35,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:35,219 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:35,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-16 03:15:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2021-12-16 03:15:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.188235294117647) internal successors, (101), 89 states have internal predecessors, (101), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-16 03:15:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2021-12-16 03:15:35,225 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 50 [2021-12-16 03:15:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:35,225 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-12-16 03:15:35,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2021-12-16 03:15:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-16 03:15:35,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:35,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:35,255 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-16 03:15:35,440 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,SelfDestructingSolverStorable12 [2021-12-16 03:15:35,440 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1480660857, now seen corresponding path program 1 times [2021-12-16 03:15:35,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:35,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166929098] [2021-12-16 03:15:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:35,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:35,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:35,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166929098] [2021-12-16 03:15:35,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166929098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:35,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:35,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:15:35,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970288998] [2021-12-16 03:15:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:35,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:15:35,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:35,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:15:35,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:35,620 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:35,774 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2021-12-16 03:15:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:15:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2021-12-16 03:15:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:35,775 INFO L225 Difference]: With dead ends: 142 [2021-12-16 03:15:35,775 INFO L226 Difference]: Without dead ends: 110 [2021-12-16 03:15:35,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:35,776 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 66 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:35,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:15:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-16 03:15:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-16 03:15:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-16 03:15:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2021-12-16 03:15:35,782 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 50 [2021-12-16 03:15:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:35,782 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2021-12-16 03:15:35,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2021-12-16 03:15:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-16 03:15:35,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:35,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:35,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 03:15:35,784 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 973183812, now seen corresponding path program 1 times [2021-12-16 03:15:35,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:35,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679849812] [2021-12-16 03:15:35,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:35,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 03:15:35,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679849812] [2021-12-16 03:15:35,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679849812] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:35,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:35,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:36,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144235432] [2021-12-16 03:15:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:36,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:36,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:36,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:36,001 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:36,243 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2021-12-16 03:15:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2021-12-16 03:15:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:36,244 INFO L225 Difference]: With dead ends: 118 [2021-12-16 03:15:36,244 INFO L226 Difference]: Without dead ends: 116 [2021-12-16 03:15:36,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:36,245 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:36,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 352 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-16 03:15:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-12-16 03:15:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-16 03:15:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 139 transitions. [2021-12-16 03:15:36,252 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 139 transitions. Word has length 56 [2021-12-16 03:15:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:36,252 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 139 transitions. [2021-12-16 03:15:36,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 139 transitions. [2021-12-16 03:15:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 03:15:36,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:36,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:36,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 03:15:36,255 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1607419124, now seen corresponding path program 1 times [2021-12-16 03:15:36,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:36,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424269313] [2021-12-16 03:15:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:36,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:36,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:36,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424269313] [2021-12-16 03:15:36,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424269313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:36,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:36,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:36,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159412037] [2021-12-16 03:15:36,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:36,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:36,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:36,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:36,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:36,526 INFO L87 Difference]: Start difference. First operand 115 states and 139 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 03:15:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:36,939 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2021-12-16 03:15:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 03:15:36,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2021-12-16 03:15:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:36,942 INFO L225 Difference]: With dead ends: 163 [2021-12-16 03:15:36,942 INFO L226 Difference]: Without dead ends: 129 [2021-12-16 03:15:36,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:15:36,943 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 101 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:36,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 177 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-16 03:15:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2021-12-16 03:15:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 94 states have internal predecessors, (104), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-16 03:15:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2021-12-16 03:15:36,949 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 60 [2021-12-16 03:15:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:36,949 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2021-12-16 03:15:36,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 03:15:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2021-12-16 03:15:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 03:15:36,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:36,951 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:36,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 03:15:36,951 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1349253686, now seen corresponding path program 1 times [2021-12-16 03:15:36,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:36,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777951506] [2021-12-16 03:15:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:36,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:37,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:37,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777951506] [2021-12-16 03:15:37,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777951506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:37,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:37,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 03:15:37,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589664] [2021-12-16 03:15:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:37,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 03:15:37,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 03:15:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-16 03:15:37,353 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:37,919 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-12-16 03:15:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:15:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2021-12-16 03:15:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:37,921 INFO L225 Difference]: With dead ends: 173 [2021-12-16 03:15:37,921 INFO L226 Difference]: Without dead ends: 144 [2021-12-16 03:15:37,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-12-16 03:15:37,922 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 150 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:37,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 231 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-16 03:15:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2021-12-16 03:15:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 102 states have internal predecessors, (111), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-16 03:15:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2021-12-16 03:15:37,932 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 60 [2021-12-16 03:15:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:37,933 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2021-12-16 03:15:37,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 03:15:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2021-12-16 03:15:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 03:15:37,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:37,936 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:37,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 03:15:37,936 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1665849932, now seen corresponding path program 1 times [2021-12-16 03:15:37,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:37,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743697286] [2021-12-16 03:15:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:37,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:38,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743697286] [2021-12-16 03:15:38,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743697286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:38,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:38,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 03:15:38,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658164910] [2021-12-16 03:15:38,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:38,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:38,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:38,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:38,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:38,267 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 03:15:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:38,636 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2021-12-16 03:15:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 03:15:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2021-12-16 03:15:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:38,638 INFO L225 Difference]: With dead ends: 162 [2021-12-16 03:15:38,638 INFO L226 Difference]: Without dead ends: 119 [2021-12-16 03:15:38,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:15:38,639 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 136 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:38,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 171 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-16 03:15:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-16 03:15:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 94 states have internal predecessors, (99), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-16 03:15:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2021-12-16 03:15:38,649 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 60 [2021-12-16 03:15:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:38,649 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2021-12-16 03:15:38,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 03:15:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2021-12-16 03:15:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-16 03:15:38,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:38,651 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:38,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 03:15:38,651 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 127651990, now seen corresponding path program 1 times [2021-12-16 03:15:38,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:38,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204548583] [2021-12-16 03:15:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:38,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:15:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 03:15:38,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:38,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204548583] [2021-12-16 03:15:38,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204548583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:38,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:38,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:38,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928985070] [2021-12-16 03:15:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:38,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:38,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:38,867 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-16 03:15:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:39,154 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-12-16 03:15:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2021-12-16 03:15:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:39,155 INFO L225 Difference]: With dead ends: 125 [2021-12-16 03:15:39,156 INFO L226 Difference]: Without dead ends: 123 [2021-12-16 03:15:39,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-16 03:15:39,156 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:39,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 225 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-16 03:15:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-12-16 03:15:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-16 03:15:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2021-12-16 03:15:39,163 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 62 [2021-12-16 03:15:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:39,164 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2021-12-16 03:15:39,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-16 03:15:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2021-12-16 03:15:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-16 03:15:39,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:39,165 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:39,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 03:15:39,165 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash -554307627, now seen corresponding path program 1 times [2021-12-16 03:15:39,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:39,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616405603] [2021-12-16 03:15:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:39,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 03:15:39,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:39,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616405603] [2021-12-16 03:15:39,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616405603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:39,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:39,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 03:15:39,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081379216] [2021-12-16 03:15:39,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:39,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 03:15:39,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 03:15:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:15:39,392 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:39,704 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2021-12-16 03:15:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:15:39,705 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2021-12-16 03:15:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:39,706 INFO L225 Difference]: With dead ends: 131 [2021-12-16 03:15:39,706 INFO L226 Difference]: Without dead ends: 129 [2021-12-16 03:15:39,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-16 03:15:39,707 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:39,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 441 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-16 03:15:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2021-12-16 03:15:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-16 03:15:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2021-12-16 03:15:39,714 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 62 [2021-12-16 03:15:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:39,714 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2021-12-16 03:15:39,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 03:15:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2021-12-16 03:15:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-16 03:15:39,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:39,715 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:39,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 03:15:39,715 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:39,716 INFO L85 PathProgramCache]: Analyzing trace with hash 146756951, now seen corresponding path program 1 times [2021-12-16 03:15:39,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492986804] [2021-12-16 03:15:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:39,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 03:15:39,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:39,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492986804] [2021-12-16 03:15:39,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492986804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:39,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:39,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:39,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624363866] [2021-12-16 03:15:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:39,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:39,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:39,967 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 03:15:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:40,377 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2021-12-16 03:15:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2021-12-16 03:15:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:40,379 INFO L225 Difference]: With dead ends: 161 [2021-12-16 03:15:40,380 INFO L226 Difference]: Without dead ends: 116 [2021-12-16 03:15:40,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:40,381 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:40,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 196 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-16 03:15:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-16 03:15:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2021-12-16 03:15:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2021-12-16 03:15:40,387 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 62 [2021-12-16 03:15:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:40,388 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2021-12-16 03:15:40,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 03:15:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2021-12-16 03:15:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-16 03:15:40,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:40,389 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:40,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 03:15:40,390 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1448791323, now seen corresponding path program 1 times [2021-12-16 03:15:40,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:40,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152451778] [2021-12-16 03:15:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:40,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:15:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 03:15:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 03:15:40,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:40,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152451778] [2021-12-16 03:15:40,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152451778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:40,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701182506] [2021-12-16 03:15:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:40,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:40,611 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-16 03:15:40,619 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-16 03:15:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 2505 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 03:15:41,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 03:15:41,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:15:41,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701182506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:41,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:15:41,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-16 03:15:41,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958577921] [2021-12-16 03:15:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:41,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:15:41,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:15:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:41,252 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:41,369 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2021-12-16 03:15:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:15:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2021-12-16 03:15:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:41,373 INFO L225 Difference]: With dead ends: 204 [2021-12-16 03:15:41,373 INFO L226 Difference]: Without dead ends: 116 [2021-12-16 03:15:41,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:41,374 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:41,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 266 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-12-16 03:15:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-16 03:15:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-16 03:15:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.069767441860465) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2021-12-16 03:15:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2021-12-16 03:15:41,382 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 66 [2021-12-16 03:15:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:41,383 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2021-12-16 03:15:41,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2021-12-16 03:15:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-16 03:15:41,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:41,384 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:41,410 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-16 03:15:41,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:41,585 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2108322845, now seen corresponding path program 1 times [2021-12-16 03:15:41,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:41,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190887308] [2021-12-16 03:15:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:41,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:15:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 03:15:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 03:15:41,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:41,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190887308] [2021-12-16 03:15:41,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190887308] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:41,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123502087] [2021-12-16 03:15:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:41,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:41,729 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-16 03:15:41,730 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-16 03:15:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:42,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2500 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 03:15:42,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 03:15:42,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:15:42,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123502087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:42,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:15:42,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-16 03:15:42,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679005378] [2021-12-16 03:15:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:42,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:15:42,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:15:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:15:42,222 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:42,239 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2021-12-16 03:15:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:15:42,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2021-12-16 03:15:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:42,240 INFO L225 Difference]: With dead ends: 195 [2021-12-16 03:15:42,241 INFO L226 Difference]: Without dead ends: 102 [2021-12-16 03:15:42,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:15:42,242 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:42,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:15:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-16 03:15:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-16 03:15:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 76 states have internal predecessors, (77), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (21), 16 states have call predecessors, (21), 17 states have call successors, (21) [2021-12-16 03:15:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2021-12-16 03:15:42,248 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 66 [2021-12-16 03:15:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:42,248 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2021-12-16 03:15:42,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 03:15:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2021-12-16 03:15:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-16 03:15:42,249 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:42,249 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:42,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 03:15:42,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:42,476 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash 325130519, now seen corresponding path program 1 times [2021-12-16 03:15:42,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:42,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870618567] [2021-12-16 03:15:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:42,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:15:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 03:15:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 03:15:43,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870618567] [2021-12-16 03:15:43,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870618567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303779161] [2021-12-16 03:15:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:43,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:15:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:15:43,179 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-16 03:15:43,180 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-16 03:15:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:43,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-16 03:15:43,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:15:43,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 03:15:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 03:15:44,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:15:44,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303779161] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:15:44,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:15:44,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2021-12-16 03:15:44,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698410463] [2021-12-16 03:15:44,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 03:15:44,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 03:15:44,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:44,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 03:15:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2021-12-16 03:15:44,740 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 03:15:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:45,432 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2021-12-16 03:15:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 03:15:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2021-12-16 03:15:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:45,433 INFO L225 Difference]: With dead ends: 163 [2021-12-16 03:15:45,433 INFO L226 Difference]: Without dead ends: 105 [2021-12-16 03:15:45,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2021-12-16 03:15:45,435 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 75 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:45,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 462 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 292 Invalid, 0 Unknown, 293 Unchecked, 0.3s Time] [2021-12-16 03:15:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-16 03:15:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2021-12-16 03:15:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 71 states have internal predecessors, (72), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-16 03:15:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-16 03:15:45,440 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 66 [2021-12-16 03:15:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:45,441 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-16 03:15:45,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 03:15:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-16 03:15:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-16 03:15:45,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:45,442 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:45,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 03:15:45,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-16 03:15:45,656 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1497368934, now seen corresponding path program 1 times [2021-12-16 03:15:45,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:45,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109060265] [2021-12-16 03:15:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:45,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:15:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-16 03:15:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:15:45,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:45,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109060265] [2021-12-16 03:15:45,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109060265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:45,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:45,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 03:15:45,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057754546] [2021-12-16 03:15:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:45,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 03:15:45,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 03:15:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:45,950 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-16 03:15:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:46,323 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2021-12-16 03:15:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 03:15:46,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2021-12-16 03:15:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:46,324 INFO L225 Difference]: With dead ends: 103 [2021-12-16 03:15:46,324 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:15:46,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:15:46,325 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 59 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:46,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 200 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:15:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:15:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 74 states have internal predecessors, (75), 17 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-16 03:15:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-12-16 03:15:46,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 68 [2021-12-16 03:15:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:46,332 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-12-16 03:15:46,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-16 03:15:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-12-16 03:15:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-16 03:15:46,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:46,333 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:46,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 03:15:46,334 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:46,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:46,334 INFO L85 PathProgramCache]: Analyzing trace with hash 997273396, now seen corresponding path program 1 times [2021-12-16 03:15:46,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:46,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534643520] [2021-12-16 03:15:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:46,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:15:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-16 03:15:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 03:15:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-16 03:15:46,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:46,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534643520] [2021-12-16 03:15:46,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534643520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:46,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:46,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:15:46,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566890911] [2021-12-16 03:15:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:46,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:15:46,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:46,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:15:46,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:15:46,611 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-16 03:15:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:46,899 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2021-12-16 03:15:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:15:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2021-12-16 03:15:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:46,900 INFO L225 Difference]: With dead ends: 107 [2021-12-16 03:15:46,900 INFO L226 Difference]: Without dead ends: 105 [2021-12-16 03:15:46,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-16 03:15:46,901 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:46,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 228 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:15:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-16 03:15:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-16 03:15:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.04) internal successors, (78), 77 states have internal predecessors, (78), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-16 03:15:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2021-12-16 03:15:46,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 74 [2021-12-16 03:15:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:46,907 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2021-12-16 03:15:46,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-16 03:15:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2021-12-16 03:15:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-16 03:15:46,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:46,908 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:46,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 03:15:46,908 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 880347013, now seen corresponding path program 1 times [2021-12-16 03:15:46,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:46,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458491104] [2021-12-16 03:15:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:46,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 03:15:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:15:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:15:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-16 03:15:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 03:15:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-16 03:15:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-16 03:15:47,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:47,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458491104] [2021-12-16 03:15:47,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458491104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:47,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:47,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:15:47,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981838734] [2021-12-16 03:15:47,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:47,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:15:47,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:47,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:15:47,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:15:47,159 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-16 03:15:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:47,463 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-12-16 03:15:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:15:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2021-12-16 03:15:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:47,464 INFO L225 Difference]: With dead ends: 138 [2021-12-16 03:15:47,464 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 03:15:47,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-16 03:15:47,465 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:47,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 275 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:15:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 03:15:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-16 03:15:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-16 03:15:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-16 03:15:47,471 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 81 [2021-12-16 03:15:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:47,471 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-16 03:15:47,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-16 03:15:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-16 03:15:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-16 03:15:47,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:47,472 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:47,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 03:15:47,472 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1004637351, now seen corresponding path program 1 times [2021-12-16 03:15:47,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:47,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390484564] [2021-12-16 03:15:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:47,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:15:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 03:15:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 03:15:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-16 03:15:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-16 03:15:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 03:15:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 03:15:47,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:47,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390484564] [2021-12-16 03:15:47,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390484564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:47,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:47,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:15:47,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693443265] [2021-12-16 03:15:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:47,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:15:47,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:15:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:47,959 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-16 03:15:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:48,583 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2021-12-16 03:15:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 03:15:48,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 93 [2021-12-16 03:15:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:48,584 INFO L225 Difference]: With dead ends: 90 [2021-12-16 03:15:48,584 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 03:15:48,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2021-12-16 03:15:48,585 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:48,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 283 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 03:15:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-16 03:15:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-16 03:15:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2021-12-16 03:15:48,592 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 93 [2021-12-16 03:15:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:48,593 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-12-16 03:15:48,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-16 03:15:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2021-12-16 03:15:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-16 03:15:48,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:15:48,594 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:48,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-16 03:15:48,595 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:15:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:15:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash 131876282, now seen corresponding path program 1 times [2021-12-16 03:15:48,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:15:48,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803983064] [2021-12-16 03:15:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:15:48,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:15:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:15:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:15:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:15:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 03:15:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:15:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 03:15:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 03:15:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-16 03:15:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-16 03:15:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 03:15:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-16 03:15:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 03:15:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-16 03:15:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:15:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-16 03:15:49,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:15:49,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803983064] [2021-12-16 03:15:49,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803983064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:15:49,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:15:49,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:15:49,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059863627] [2021-12-16 03:15:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:15:49,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:15:49,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:15:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:15:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:15:49,414 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-16 03:15:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:15:49,942 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2021-12-16 03:15:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 03:15:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 110 [2021-12-16 03:15:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:15:49,943 INFO L225 Difference]: With dead ends: 86 [2021-12-16 03:15:49,943 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 03:15:49,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-12-16 03:15:49,944 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:15:49,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 304 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:15:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 03:15:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 03:15:49,948 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-16 03:15:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 03:15:49,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2021-12-16 03:15:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:15:49,948 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 03:15:49,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-16 03:15:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 03:15:49,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 03:15:49,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 03:15:49,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-16 03:15:49,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 03:15:51,613 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-16 03:15:51,613 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-16 03:15:51,614 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-16 03:15:51,614 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-16 03:15:51,614 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-16 03:15:51,614 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2021-12-16 03:15:51,614 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-12-16 03:15:51,614 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-12-16 03:15:51,614 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,614 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-16 03:15:51,615 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L854 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse4 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (= (select .cse2 .cse3) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse0 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse2 .cse1) 0))) [2021-12-16 03:15:51,616 INFO L861 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: true [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L854 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse18 .cse16) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse12 (select .cse15 .cse19)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse6 (= (select .cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse8 (= (select .cse18 .cse19) 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1211#1| 0)) (.cse11 (= (select .cse17 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= (select .cse15 .cse16) 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 0) .cse13 .cse14) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse12) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14)))) [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 03:15:51,616 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L858 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L858 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L861 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2021-12-16 03:15:51,617 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse4 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (= (select .cse2 .cse3) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse0 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem588#1| |ULTIMATE.start_assert_bytes_match_#t~mem589#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse2 .cse1) 0))) [2021-12-16 03:15:51,617 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse4 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (= (select .cse2 .cse3) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse0 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse2 .cse1) 0))) [2021-12-16 03:15:51,617 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse18 .cse16) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse11 (select .cse15 .cse19)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse6 (= (select .cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse8 (= (select .cse18 .cse19) 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse10 (= (select .cse17 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= (select .cse15 .cse16) 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 0) .cse12 .cse13 .cse14) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse11) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14)))) [2021-12-16 03:15:51,617 INFO L858 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-16 03:15:51,617 INFO L854 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse6 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse5 (select .cse13 .cse12)) (.cse7 (= (select .cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (.cse0 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse9 (= (select .cse11 .cse14) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= (select .cse13 .cse14) 0)) (.cse4 (= (select .cse11 .cse12) 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (< 0 (mod |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616))) (and .cse6 (= .cse5 0) .cse7 .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4)))) [2021-12-16 03:15:51,618 INFO L854 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse20 .cse17) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1213#1.base| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1213#1.offset| 0)) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse9 (= (select .cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse11 (= (select .cse20 .cse18) 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse13 (= (select .cse19 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse5 (select .cse16 .cse18)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (= (select .cse16 .cse17) 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse5) .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 .cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= .cse5 0) .cse14 .cse15)))) [2021-12-16 03:15:51,618 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-16 03:15:51,618 INFO L858 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2021-12-16 03:15:51,618 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse4 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (= (select .cse2 .cse3) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse0 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse2 .cse1) 0))) [2021-12-16 03:15:51,618 INFO L858 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2021-12-16 03:15:51,618 INFO L854 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse16 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse13 (select .cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1059#1| 1)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1059#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse6 (= (select .cse17 .cse15) 0)) (.cse7 (= (select .cse14 .cse18) 0)) (.cse1 (select .cse17 .cse18)) (.cse8 (= (select .cse16 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse9 (= .cse13 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (.cse11 (= (select .cse14 .cse15) 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|))) (or (and .cse0 (= .cse1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse1) .cse8 .cse9 .cse10 (<= .cse13 (+ (* 18446744073709551616 (div (+ .cse13 (- 1)) 18446744073709551616)) 18446744073709551615)) .cse11 .cse12))))) [2021-12-16 03:15:51,618 INFO L858 garLoopResultBuilder]: For program point L8222(lines 8222 8223) no Hoare annotation was computed. [2021-12-16 03:15:51,618 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-16 03:15:51,618 INFO L858 garLoopResultBuilder]: For program point L8222-2(lines 8222 8223) no Hoare annotation was computed. [2021-12-16 03:15:51,618 INFO L854 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse19 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse21 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse21 .cse18) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse7 (<= 0 .cse19)) (.cse8 (= (select .cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse10 (= (select .cse21 .cse20) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1210#1|)) (.cse3 (select .cse17 .cse20)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (<= .cse19 0)) (.cse15 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1210#1| 1)) (.cse16 (= (select .cse17 .cse18) 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse3) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= .cse3 0) .cse13 .cse14 .cse15 .cse16))))) [2021-12-16 03:15:51,619 INFO L854 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse1 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse8 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (<= .cse8 (+ (* 18446744073709551616 (div (+ .cse8 (- 1)) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse8)))) .cse5))) [2021-12-16 03:15:51,619 INFO L858 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2021-12-16 03:15:51,619 INFO L854 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse2 (select .cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 16))) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse19 .cse16) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse8 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse10 (= (select .cse19 .cse17) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse12 (= (select .cse18 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse4 (select .cse15 .cse17)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= (select .cse15 .cse16) 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse0 .cse1 (<= .cse2 (+ (* 18446744073709551616 (div (+ .cse2 (- 1)) 18446744073709551616)) 18446744073709551615)) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| .cse4) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0) .cse0 .cse1 .cse3 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (= .cse4 0) .cse13 .cse14))))) [2021-12-16 03:15:51,619 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-16 03:15:51,619 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-16 03:15:51,619 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-16 03:15:51,619 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-16 03:15:51,619 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-16 03:15:51,619 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-16 03:15:51,622 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:15:51,623 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 03:15:51,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:51,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:51,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:51,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:51,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:51,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:51,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:51,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:15:51 BoogieIcfgContainer [2021-12-16 03:15:51,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 03:15:51,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 03:15:51,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 03:15:51,642 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 03:15:51,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:15:24" (3/4) ... [2021-12-16 03:15:51,645 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 03:15:51,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-16 03:15:51,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-16 03:15:51,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-16 03:15:51,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-16 03:15:51,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-16 03:15:51,659 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-12-16 03:15:51,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-16 03:15:51,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-16 03:15:51,662 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-16 03:15:51,663 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-16 03:15:51,664 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-16 03:15:51,665 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 03:15:51,665 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 03:15:51,689 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && unknown-#res!capacity-unknown == capacity) && !(0 == buf)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && capacity == capacity) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) || ((((((((((((bytes == 0 && unknown-#res!capacity-unknown == capacity) && !(0 == buf)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && bytes == array) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && array == 0) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] <= 18446744073709551616 * ((unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] + -1) / 18446744073709551616) + 18446744073709551615 && unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16])) && capacity == capacity) [2021-12-16 03:15:52,253 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 03:15:52,253 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 03:15:52,254 INFO L158 Benchmark]: Toolchain (without parser) took 30760.75ms. Allocated memory was 86.0MB in the beginning and 436.2MB in the end (delta: 350.2MB). Free memory was 55.4MB in the beginning and 187.2MB in the end (delta: -131.8MB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,254 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:15:52,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2111.80ms. Allocated memory was 86.0MB in the beginning and 144.7MB in the end (delta: 58.7MB). Free memory was 55.1MB in the beginning and 59.6MB in the end (delta: -4.4MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 167.67ms. Allocated memory is still 144.7MB. Free memory was 59.6MB in the beginning and 87.2MB in the end (delta: -27.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,255 INFO L158 Benchmark]: Boogie Preprocessor took 98.12ms. Allocated memory is still 144.7MB. Free memory was 87.2MB in the beginning and 80.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,255 INFO L158 Benchmark]: RCFGBuilder took 942.27ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 80.9MB in the beginning and 112.5MB in the end (delta: -31.6MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,255 INFO L158 Benchmark]: TraceAbstraction took 26822.07ms. Allocated memory was 174.1MB in the beginning and 436.2MB in the end (delta: 262.1MB). Free memory was 112.5MB in the beginning and 242.7MB in the end (delta: -130.2MB). Peak memory consumption was 254.9MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,255 INFO L158 Benchmark]: Witness Printer took 611.52ms. Allocated memory is still 436.2MB. Free memory was 242.7MB in the beginning and 187.2MB in the end (delta: 55.5MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. [2021-12-16 03:15:52,256 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.19ms. Allocated memory is still 86.0MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2111.80ms. Allocated memory was 86.0MB in the beginning and 144.7MB in the end (delta: 58.7MB). Free memory was 55.1MB in the beginning and 59.6MB in the end (delta: -4.4MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 167.67ms. Allocated memory is still 144.7MB. Free memory was 59.6MB in the beginning and 87.2MB in the end (delta: -27.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.12ms. Allocated memory is still 144.7MB. Free memory was 87.2MB in the beginning and 80.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 942.27ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 80.9MB in the beginning and 112.5MB in the end (delta: -31.6MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26822.07ms. Allocated memory was 174.1MB in the beginning and 436.2MB in the end (delta: 262.1MB). Free memory was 112.5MB in the beginning and 242.7MB in the end (delta: -130.2MB). Peak memory consumption was 254.9MB. Max. memory is 16.1GB. * Witness Printer took 611.52ms. Allocated memory is still 436.2MB. Free memory was 242.7MB in the beginning and 187.2MB in the end (delta: 55.5MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] * 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 6 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 29, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1988 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1922 mSDsluCounter, 7926 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 357 IncrementalHoareTripleChecker+Unchecked, 5764 mSDsCounter, 622 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7599 IncrementalHoareTripleChecker+Invalid, 8578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 622 mSolverCounterUnsat, 2162 mSDtfsCounter, 7599 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 669 SyntacticMatches, 13 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=17, InterpolantAutomatonStates: 275, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 217 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 220 PreInvPairs, 245 NumberOfFragments, 1808 HoareAnnotationTreeSize, 220 FomulaSimplifications, 547 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 4760 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1875 ConstructedInterpolants, 36 QuantifiedInterpolants, 8620 SizeOfPredicates, 27 NumberOfNonLiveVariables, 12376 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 602/653 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: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2021-12-16 03:15:52,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:52,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:52,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:52,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-16 03:15:52,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:52,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-16 03:15:52,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] Derived loop invariant: ((((((((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && unknown-#res!capacity-unknown == capacity) && !(0 == buf)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && capacity == capacity) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) || ((((((((((((bytes == 0 && unknown-#res!capacity-unknown == capacity) && !(0 == buf)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && bytes == array) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && array == 0) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] <= 18446744073709551616 * ((unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] + -1) / 18446744073709551616) + 18446744073709551615 && unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16])) && capacity == capacity) RESULT: Ultimate proved your program to be correct! [2021-12-16 03:15:52,306 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