./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:14:24,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:14:24,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:14:24,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:14:24,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:14:24,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:14:24,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:14:24,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:14:24,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:14:24,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:14:24,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:14:24,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:14:24,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:14:24,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:14:24,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:14:24,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:14:24,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:14:24,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:14:24,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:14:24,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:14:24,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:14:24,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:14:24,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:14:24,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:14:24,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:14:24,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:14:24,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:14:24,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:14:24,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:14:24,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:14:24,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:14:24,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:14:24,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:14:24,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:14:24,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:14:24,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:14:24,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:14:24,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:14:24,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:14:24,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:14:24,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:14:24,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:14:24,286 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:14:24,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:14:24,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:14:24,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:14:24,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:14:24,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:14:24,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:14:24,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:14:24,290 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:14:24,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:14:24,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:14:24,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:14:24,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:14:24,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:14:24,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:14:24,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:14:24,292 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:14:24,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:14:24,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:14:24,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:14:24,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:14:24,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:14:24,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:14:24,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:14:24,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:14:24,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:14:24,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:14:24,294 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:14:24,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:14:24,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:14:24,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2021-12-28 03:14:24,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:14:24,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:14:24,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:14:24,585 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:14:24,585 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:14:24,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-12-28 03:14:24,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50cbf4ab/b2da9f8ae63c47a597c32111413c7d9e/FLAG11fd28a51 [2021-12-28 03:14:25,266 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:14:25,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-12-28 03:14:25,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50cbf4ab/b2da9f8ae63c47a597c32111413c7d9e/FLAG11fd28a51 [2021-12-28 03:14:25,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50cbf4ab/b2da9f8ae63c47a597c32111413c7d9e [2021-12-28 03:14:25,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:14:25,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:14:25,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:14:25,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:14:25,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:14:25,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:14:25" (1/1) ... [2021-12-28 03:14:25,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca20648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:25, skipping insertion in model container [2021-12-28 03:14:25,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:14:25" (1/1) ... [2021-12-28 03:14:25,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:14:25,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:14:25,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2021-12-28 03:14:25,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2021-12-28 03:14:26,454 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,455 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,456 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,457 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,458 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,466 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,468 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,469 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,470 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,687 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:14:26,688 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:14:26,689 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:14:26,690 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:14:26,690 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:14:26,691 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:14:26,691 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:14:26,692 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:14:26,692 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:14:26,692 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:14:26,794 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:14:26,886 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,887 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:26,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:14:26,972 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:14:26,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2021-12-28 03:14:26,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2021-12-28 03:14:27,024 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,024 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,024 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,025 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,025 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,028 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,028 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,029 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,029 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,045 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:14:27,045 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:14:27,046 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:14:27,046 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:14:27,046 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:14:27,047 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:14:27,047 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:14:27,047 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:14:27,048 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:14:27,048 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:14:27,074 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:14:27,132 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,133 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:14:27,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:14:27,385 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:14:27,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27 WrapperNode [2021-12-28 03:14:27,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:14:27,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:14:27,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:14:27,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:14:27,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,510 INFO L137 Inliner]: procedures = 690, calls = 2615, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 766 [2021-12-28 03:14:27,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:14:27,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:14:27,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:14:27,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:14:27,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:14:27,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:14:27,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:14:27,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:14:27,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (1/1) ... [2021-12-28 03:14:27,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:14:27,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:27,612 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-28 03:14:27,628 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-28 03:14:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-28 03:14:27,655 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-28 03:14:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:14:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:14:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-28 03:14:27,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-28 03:14:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:14:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:14:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 03:14:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:14:27,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:14:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-28 03:14:27,658 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-28 03:14:27,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 03:14:27,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 03:14:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 03:14:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 03:14:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:14:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-28 03:14:27,659 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-28 03:14:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:14:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:14:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2021-12-28 03:14:27,660 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2021-12-28 03:14:27,861 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:14:27,862 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:14:28,566 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:14:28,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:14:28,571 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 03:14:28,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:14:28 BoogieIcfgContainer [2021-12-28 03:14:28,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:14:28,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:14:28,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:14:28,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:14:28,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:14:25" (1/3) ... [2021-12-28 03:14:28,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62882b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:14:28, skipping insertion in model container [2021-12-28 03:14:28,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:14:27" (2/3) ... [2021-12-28 03:14:28,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62882b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:14:28, skipping insertion in model container [2021-12-28 03:14:28,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:14:28" (3/3) ... [2021-12-28 03:14:28,578 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2021-12-28 03:14:28,581 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:14:28,581 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:14:28,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:14:28,614 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-28 03:14:28,614 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:14:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-28 03:14:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 03:14:28,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:28,629 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:28,629 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -537066619, now seen corresponding path program 1 times [2021-12-28 03:14:28,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:28,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544843707] [2021-12-28 03:14:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:28,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,078 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-28 03:14:29,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:29,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544843707] [2021-12-28 03:14:29,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544843707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:29,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:29,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:14:29,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168138891] [2021-12-28 03:14:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:29,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:14:29,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:14:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:14:29,114 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:29,223 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2021-12-28 03:14:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:14:29,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-12-28 03:14:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:29,230 INFO L225 Difference]: With dead ends: 145 [2021-12-28 03:14:29,231 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 03:14:29,233 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-28 03:14:29,235 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:29,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:14:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 03:14:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-28 03:14:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-28 03:14:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2021-12-28 03:14:29,263 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 33 [2021-12-28 03:14:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:29,264 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2021-12-28 03:14:29,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2021-12-28 03:14:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 03:14:29,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:29,266 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:29,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:14:29,266 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash 365093061, now seen corresponding path program 1 times [2021-12-28 03:14:29,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:29,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837476279] [2021-12-28 03:14:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:29,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,445 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-28 03:14:29,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837476279] [2021-12-28 03:14:29,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837476279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:29,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:29,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:14:29,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31933845] [2021-12-28 03:14:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:29,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:14:29,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:29,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:14:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:14:29,448 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:29,601 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2021-12-28 03:14:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:14:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-12-28 03:14:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:29,603 INFO L225 Difference]: With dead ends: 123 [2021-12-28 03:14:29,603 INFO L226 Difference]: Without dead ends: 71 [2021-12-28 03:14:29,604 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-28 03:14:29,605 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:29,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 157 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:14:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-28 03:14:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-28 03:14:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2021-12-28 03:14:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2021-12-28 03:14:29,612 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 33 [2021-12-28 03:14:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:29,613 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2021-12-28 03:14:29,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2021-12-28 03:14:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 03:14:29,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:29,614 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:29,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:14:29,614 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1309209872, now seen corresponding path program 1 times [2021-12-28 03:14:29,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:29,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076330356] [2021-12-28 03:14:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:29,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:14:29,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:29,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076330356] [2021-12-28 03:14:29,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076330356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:29,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:29,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:14:29,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59680590] [2021-12-28 03:14:29,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:29,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:14:29,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:29,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:14:29,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:14:29,841 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:30,105 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2021-12-28 03:14:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:14:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2021-12-28 03:14:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:30,106 INFO L225 Difference]: With dead ends: 83 [2021-12-28 03:14:30,106 INFO L226 Difference]: Without dead ends: 81 [2021-12-28 03:14:30,107 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-28 03:14:30,107 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:30,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 310 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-28 03:14:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-12-28 03:14:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-12-28 03:14:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2021-12-28 03:14:30,114 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2021-12-28 03:14:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:30,114 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2021-12-28 03:14:30,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2021-12-28 03:14:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:30,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:30,115 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-28 03:14:30,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:14:30,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash -853000232, now seen corresponding path program 1 times [2021-12-28 03:14:30,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:30,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179083899] [2021-12-28 03:14:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:30,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,313 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-28 03:14:30,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179083899] [2021-12-28 03:14:30,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179083899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:30,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:30,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:14:30,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403997878] [2021-12-28 03:14:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:30,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:14:30,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:14:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:14:30,315 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:30,532 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2021-12-28 03:14:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 03:14:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-28 03:14:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:30,533 INFO L225 Difference]: With dead ends: 164 [2021-12-28 03:14:30,533 INFO L226 Difference]: Without dead ends: 105 [2021-12-28 03:14:30,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:14:30,534 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:30,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 188 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-28 03:14:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2021-12-28 03:14:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-12-28 03:14:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2021-12-28 03:14:30,541 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 43 [2021-12-28 03:14:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:30,542 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2021-12-28 03:14:30,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2021-12-28 03:14:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:30,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:30,543 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-28 03:14:30,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:14:30,543 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -594834794, now seen corresponding path program 1 times [2021-12-28 03:14:30,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:30,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408585095] [2021-12-28 03:14:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:30,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:30,805 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-28 03:14:30,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:30,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408585095] [2021-12-28 03:14:30,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408585095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:30,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:30,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:14:30,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144754981] [2021-12-28 03:14:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:30,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:14:30,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:14:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:14:30,808 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:31,144 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2021-12-28 03:14:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:14:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-28 03:14:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:31,146 INFO L225 Difference]: With dead ends: 180 [2021-12-28 03:14:31,146 INFO L226 Difference]: Without dead ends: 111 [2021-12-28 03:14:31,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:14:31,147 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 127 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:31,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 237 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:14:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-28 03:14:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2021-12-28 03:14:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-28 03:14:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-12-28 03:14:31,156 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 43 [2021-12-28 03:14:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:31,157 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-12-28 03:14:31,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-12-28 03:14:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:31,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:31,158 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-28 03:14:31,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:14:31,159 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1874698472, now seen corresponding path program 1 times [2021-12-28 03:14:31,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:31,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760875704] [2021-12-28 03:14:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:31,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:31,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:31,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:31,656 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-28 03:14:31,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760875704] [2021-12-28 03:14:31,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760875704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:31,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623989870] [2021-12-28 03:14:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:31,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:31,687 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-28 03:14:31,708 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-28 03:14:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:32,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-28 03:14:32,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:32,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:32,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:32,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:32,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-28 03:14:32,466 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-28 03:14:32,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:32,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623989870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:32,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:32,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2021-12-28 03:14:32,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389756508] [2021-12-28 03:14:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:32,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:14:32,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:14:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-12-28 03:14:32,468 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:32,539 INFO L93 Difference]: Finished difference Result 233 states and 286 transitions. [2021-12-28 03:14:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:14:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-28 03:14:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:32,541 INFO L225 Difference]: With dead ends: 233 [2021-12-28 03:14:32,541 INFO L226 Difference]: Without dead ends: 119 [2021-12-28 03:14:32,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2021-12-28 03:14:32,545 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:32,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 327 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2021-12-28 03:14:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-28 03:14:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2021-12-28 03:14:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 92 states have internal predecessors, (104), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-28 03:14:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-12-28 03:14:32,565 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 43 [2021-12-28 03:14:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:32,566 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-12-28 03:14:32,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-12-28 03:14:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:32,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:32,570 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-28 03:14:32,593 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-28 03:14:32,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 03:14:32,785 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash 573755484, now seen corresponding path program 1 times [2021-12-28 03:14:32,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499295696] [2021-12-28 03:14:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:32,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:32,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,032 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-28 03:14:33,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499295696] [2021-12-28 03:14:33,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499295696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:33,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:33,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:14:33,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062907727] [2021-12-28 03:14:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:33,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:14:33,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:14:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:14:33,034 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:33,364 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2021-12-28 03:14:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:14:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-28 03:14:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:33,366 INFO L225 Difference]: With dead ends: 223 [2021-12-28 03:14:33,366 INFO L226 Difference]: Without dead ends: 140 [2021-12-28 03:14:33,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:14:33,367 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:33,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 235 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:14:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-28 03:14:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-12-28 03:14:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 98 states have internal predecessors, (112), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-28 03:14:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2021-12-28 03:14:33,374 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 43 [2021-12-28 03:14:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:33,374 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2021-12-28 03:14:33,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2021-12-28 03:14:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:33,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:33,376 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-28 03:14:33,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:14:33,376 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 831920922, now seen corresponding path program 1 times [2021-12-28 03:14:33,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:33,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950400171] [2021-12-28 03:14:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:33,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,532 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-28 03:14:33,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:33,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950400171] [2021-12-28 03:14:33,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950400171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:33,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:33,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:14:33,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561314155] [2021-12-28 03:14:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:33,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:14:33,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:33,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:14:33,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:14:33,534 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:33,790 INFO L93 Difference]: Finished difference Result 236 states and 300 transitions. [2021-12-28 03:14:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:14:33,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-28 03:14:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:33,793 INFO L225 Difference]: With dead ends: 236 [2021-12-28 03:14:33,793 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 03:14:33,794 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-28 03:14:33,795 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 55 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:33,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 197 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 03:14:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2021-12-28 03:14:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 98 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-28 03:14:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2021-12-28 03:14:33,807 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 43 [2021-12-28 03:14:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:33,807 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2021-12-28 03:14:33,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2021-12-28 03:14:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:33,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:33,809 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-28 03:14:33,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:14:33,809 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -375980076, now seen corresponding path program 1 times [2021-12-28 03:14:33,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:33,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802203845] [2021-12-28 03:14:33,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:33,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,090 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-28 03:14:34,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:34,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802203845] [2021-12-28 03:14:34,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802203845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:34,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:34,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:14:34,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457609134] [2021-12-28 03:14:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:34,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:14:34,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:34,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:14:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:14:34,093 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:34,590 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2021-12-28 03:14:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 03:14:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-28 03:14:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:34,593 INFO L225 Difference]: With dead ends: 221 [2021-12-28 03:14:34,593 INFO L226 Difference]: Without dead ends: 132 [2021-12-28 03:14:34,594 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-28 03:14:34,595 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:34,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 304 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:14:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-28 03:14:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2021-12-28 03:14:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 91 states have internal predecessors, (103), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-28 03:14:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2021-12-28 03:14:34,602 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 43 [2021-12-28 03:14:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:34,602 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2021-12-28 03:14:34,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2021-12-28 03:14:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 03:14:34,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:34,604 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-28 03:14:34,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 03:14:34,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1655843754, now seen corresponding path program 1 times [2021-12-28 03:14:34,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:34,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205478296] [2021-12-28 03:14:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:34,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:34,850 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-28 03:14:34,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:34,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205478296] [2021-12-28 03:14:34,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205478296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:34,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:34,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:14:34,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371799940] [2021-12-28 03:14:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:34,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:14:34,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:34,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:14:34,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:14:34,852 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:35,340 INFO L93 Difference]: Finished difference Result 227 states and 280 transitions. [2021-12-28 03:14:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:14:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-28 03:14:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:35,342 INFO L225 Difference]: With dead ends: 227 [2021-12-28 03:14:35,342 INFO L226 Difference]: Without dead ends: 140 [2021-12-28 03:14:35,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:14:35,343 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 113 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:35,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 261 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:14:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-28 03:14:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-12-28 03:14:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 98 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-28 03:14:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2021-12-28 03:14:35,353 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 43 [2021-12-28 03:14:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:35,353 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2021-12-28 03:14:35,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2021-12-28 03:14:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 03:14:35,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:35,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:35,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 03:14:35,355 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1365554723, now seen corresponding path program 1 times [2021-12-28 03:14:35,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:35,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295972270] [2021-12-28 03:14:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:35,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,484 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-28 03:14:35,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:35,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295972270] [2021-12-28 03:14:35,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295972270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:35,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:35,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:14:35,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175277536] [2021-12-28 03:14:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:35,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:14:35,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:14:35,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:14:35,488 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:35,615 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-12-28 03:14:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:14:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-12-28 03:14:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:35,617 INFO L225 Difference]: With dead ends: 217 [2021-12-28 03:14:35,617 INFO L226 Difference]: Without dead ends: 121 [2021-12-28 03:14:35,617 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-28 03:14:35,618 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:35,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 173 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:14:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-28 03:14:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2021-12-28 03:14:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-28 03:14:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2021-12-28 03:14:35,625 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 45 [2021-12-28 03:14:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:35,626 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2021-12-28 03:14:35,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2021-12-28 03:14:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 03:14:35,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:35,627 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:35,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 03:14:35,627 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2043381215, now seen corresponding path program 1 times [2021-12-28 03:14:35,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505891225] [2021-12-28 03:14:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:35,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:35,797 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-28 03:14:35,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:35,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505891225] [2021-12-28 03:14:35,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505891225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:35,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:35,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 03:14:35,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652238406] [2021-12-28 03:14:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:35,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:14:35,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:14:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:14:35,799 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:36,099 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2021-12-28 03:14:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:14:36,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-12-28 03:14:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:36,102 INFO L225 Difference]: With dead ends: 129 [2021-12-28 03:14:36,102 INFO L226 Difference]: Without dead ends: 127 [2021-12-28 03:14:36,102 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-28 03:14:36,102 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 64 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:36,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 383 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-28 03:14:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2021-12-28 03:14:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-28 03:14:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-12-28 03:14:36,108 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 45 [2021-12-28 03:14:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:36,108 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-12-28 03:14:36,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 03:14:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-12-28 03:14:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 03:14:36,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:36,109 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:36,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 03:14:36,109 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1342316637, now seen corresponding path program 1 times [2021-12-28 03:14:36,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:36,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316636324] [2021-12-28 03:14:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:36,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:36,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:36,530 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-28 03:14:36,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:36,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316636324] [2021-12-28 03:14:36,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316636324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:36,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:36,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-28 03:14:36,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673614631] [2021-12-28 03:14:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:36,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 03:14:36,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:36,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 03:14:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:14:36,531 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 03:14:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:37,282 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2021-12-28 03:14:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 03:14:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2021-12-28 03:14:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:37,284 INFO L225 Difference]: With dead ends: 131 [2021-12-28 03:14:37,284 INFO L226 Difference]: Without dead ends: 129 [2021-12-28 03:14:37,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2021-12-28 03:14:37,285 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 92 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:37,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 506 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:14:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-28 03:14:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-28 03:14:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-28 03:14:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-12-28 03:14:37,290 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 45 [2021-12-28 03:14:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:37,291 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-12-28 03:14:37,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 03:14:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-12-28 03:14:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 03:14:37,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:37,294 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:37,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 03:14:37,294 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1476330143, now seen corresponding path program 1 times [2021-12-28 03:14:37,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:37,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084425014] [2021-12-28 03:14:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:37,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:14:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:14:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,528 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-28 03:14:37,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:37,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084425014] [2021-12-28 03:14:37,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084425014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:37,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:37,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 03:14:37,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925997484] [2021-12-28 03:14:37,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:37,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:14:37,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:14:37,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:14:37,531 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:37,815 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2021-12-28 03:14:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:14:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2021-12-28 03:14:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:37,816 INFO L225 Difference]: With dead ends: 206 [2021-12-28 03:14:37,816 INFO L226 Difference]: Without dead ends: 123 [2021-12-28 03:14:37,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:14:37,817 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:37,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 217 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-28 03:14:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2021-12-28 03:14:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-28 03:14:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2021-12-28 03:14:37,824 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 45 [2021-12-28 03:14:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:37,824 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2021-12-28 03:14:37,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 03:14:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2021-12-28 03:14:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-28 03:14:37,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:37,827 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:37,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 03:14:37,827 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash 316076503, now seen corresponding path program 1 times [2021-12-28 03:14:37,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:37,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799492279] [2021-12-28 03:14:37,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:37,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:37,962 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-28 03:14:37,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799492279] [2021-12-28 03:14:37,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799492279] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715371206] [2021-12-28 03:14:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:37,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:37,980 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-28 03:14:37,981 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-28 03:14:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 03:14:38,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:38,385 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-28 03:14:38,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:38,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715371206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:38,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:38,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-28 03:14:38,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954283840] [2021-12-28 03:14:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:38,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:14:38,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:14:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:14:38,388 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:14:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:38,406 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2021-12-28 03:14:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:14:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-12-28 03:14:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:38,408 INFO L225 Difference]: With dead ends: 201 [2021-12-28 03:14:38,408 INFO L226 Difference]: Without dead ends: 114 [2021-12-28 03:14:38,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:14:38,410 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:38,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 244 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:14:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-28 03:14:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2021-12-28 03:14:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 85 states have internal predecessors, (93), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-28 03:14:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2021-12-28 03:14:38,416 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 54 [2021-12-28 03:14:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:38,416 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2021-12-28 03:14:38,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:14:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2021-12-28 03:14:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-28 03:14:38,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:38,417 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:38,448 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-28 03:14:38,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-28 03:14:38,633 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash 691123421, now seen corresponding path program 1 times [2021-12-28 03:14:38,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:38,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077664048] [2021-12-28 03:14:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:38,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:38,812 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-28 03:14:38,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:38,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077664048] [2021-12-28 03:14:38,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077664048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:38,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:38,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 03:14:38,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652976185] [2021-12-28 03:14:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:38,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 03:14:38,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 03:14:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:14:38,814 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:14:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:38,995 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2021-12-28 03:14:38,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:14:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-12-28 03:14:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:38,996 INFO L225 Difference]: With dead ends: 140 [2021-12-28 03:14:38,996 INFO L226 Difference]: Without dead ends: 108 [2021-12-28 03:14:38,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:14:38,997 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:38,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 162 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-28 03:14:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-28 03:14:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-28 03:14:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2021-12-28 03:14:39,001 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 54 [2021-12-28 03:14:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:39,002 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2021-12-28 03:14:39,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:14:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2021-12-28 03:14:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-28 03:14:39,002 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:39,002 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:39,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 03:14:39,002 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:39,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -324954328, now seen corresponding path program 1 times [2021-12-28 03:14:39,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:39,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893654963] [2021-12-28 03:14:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:39,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,205 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-28 03:14:39,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893654963] [2021-12-28 03:14:39,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893654963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:39,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:39,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:14:39,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348794326] [2021-12-28 03:14:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:39,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:14:39,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:14:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:14:39,208 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 03:14:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:39,486 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2021-12-28 03:14:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:14:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2021-12-28 03:14:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:39,488 INFO L225 Difference]: With dead ends: 116 [2021-12-28 03:14:39,488 INFO L226 Difference]: Without dead ends: 114 [2021-12-28 03:14:39,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:14:39,488 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 92 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:39,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 289 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:14:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-28 03:14:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-12-28 03:14:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.130952380952381) internal successors, (95), 88 states have internal predecessors, (95), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2021-12-28 03:14:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-12-28 03:14:39,493 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 60 [2021-12-28 03:14:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:39,494 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-12-28 03:14:39,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 03:14:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-12-28 03:14:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 03:14:39,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:39,495 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:39,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 03:14:39,495 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2057101486, now seen corresponding path program 1 times [2021-12-28 03:14:39,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933497187] [2021-12-28 03:14:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:39,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:39,827 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-28 03:14:39,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:39,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933497187] [2021-12-28 03:14:39,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933497187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:39,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:39,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:14:39,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858624521] [2021-12-28 03:14:39,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:39,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:14:39,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:14:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:14:39,829 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-28 03:14:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:40,478 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2021-12-28 03:14:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:14:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-12-28 03:14:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:40,479 INFO L225 Difference]: With dead ends: 173 [2021-12-28 03:14:40,479 INFO L226 Difference]: Without dead ends: 144 [2021-12-28 03:14:40,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:14:40,480 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 184 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:40,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 265 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:14:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-28 03:14:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2021-12-28 03:14:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 9 states have call predecessors, (19), 13 states have return successors, (28), 18 states have call predecessors, (28), 18 states have call successors, (28) [2021-12-28 03:14:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2021-12-28 03:14:40,487 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 64 [2021-12-28 03:14:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:40,487 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2021-12-28 03:14:40,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-28 03:14:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2021-12-28 03:14:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 03:14:40,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:40,488 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:40,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 03:14:40,488 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 777237808, now seen corresponding path program 1 times [2021-12-28 03:14:40,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:40,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248402705] [2021-12-28 03:14:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:40,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 03:14:40,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248402705] [2021-12-28 03:14:40,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248402705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428175278] [2021-12-28 03:14:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:40,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:40,860 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-28 03:14:40,861 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-28 03:14:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:41,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-28 03:14:41,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:41,344 INFO L353 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-28 03:14:41,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-28 03:14:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:14:42,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:42,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428175278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:42,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:42,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 29 [2021-12-28 03:14:42,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63240117] [2021-12-28 03:14:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:42,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:14:42,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:42,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:14:42,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2021-12-28 03:14:42,327 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:42,483 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2021-12-28 03:14:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 03:14:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2021-12-28 03:14:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:42,484 INFO L225 Difference]: With dead ends: 204 [2021-12-28 03:14:42,484 INFO L226 Difference]: Without dead ends: 163 [2021-12-28 03:14:42,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2021-12-28 03:14:42,485 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 30 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:42,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 716 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 114 Unchecked, 0.1s Time] [2021-12-28 03:14:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-28 03:14:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2021-12-28 03:14:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.131578947368421) internal successors, (129), 119 states have internal predecessors, (129), 21 states have call successors, (21), 11 states have call predecessors, (21), 16 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2021-12-28 03:14:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2021-12-28 03:14:42,493 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 64 [2021-12-28 03:14:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:42,493 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2021-12-28 03:14:42,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2021-12-28 03:14:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 03:14:42,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:42,494 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:42,515 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-28 03:14:42,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:42,712 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1069275532, now seen corresponding path program 1 times [2021-12-28 03:14:42,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:42,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672487894] [2021-12-28 03:14:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:42,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 03:14:43,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672487894] [2021-12-28 03:14:43,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672487894] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918299666] [2021-12-28 03:14:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:43,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:43,015 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-28 03:14:43,072 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-28 03:14:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:43,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-28 03:14:43,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:43,566 INFO L353 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-28 03:14:43,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-28 03:14:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:14:44,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:44,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918299666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:44,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:44,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2021-12-28 03:14:44,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366510710] [2021-12-28 03:14:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:44,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 03:14:44,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 03:14:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2021-12-28 03:14:44,412 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:44,503 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-12-28 03:14:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 03:14:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2021-12-28 03:14:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:44,505 INFO L225 Difference]: With dead ends: 212 [2021-12-28 03:14:44,505 INFO L226 Difference]: Without dead ends: 170 [2021-12-28 03:14:44,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2021-12-28 03:14:44,506 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 33 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:44,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 1040 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 201 Unchecked, 0.0s Time] [2021-12-28 03:14:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-28 03:14:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2021-12-28 03:14:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 134 states have internal predecessors, (146), 21 states have call successors, (21), 12 states have call predecessors, (21), 17 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2021-12-28 03:14:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2021-12-28 03:14:44,513 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 64 [2021-12-28 03:14:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:44,513 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2021-12-28 03:14:44,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2021-12-28 03:14:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-28 03:14:44,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:44,514 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:44,537 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-28 03:14:44,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:44,735 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash -418268106, now seen corresponding path program 1 times [2021-12-28 03:14:44,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:44,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453197140] [2021-12-28 03:14:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:44,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 03:14:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,080 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-28 03:14:45,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:45,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453197140] [2021-12-28 03:14:45,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453197140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:45,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:45,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:14:45,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315379270] [2021-12-28 03:14:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:45,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:14:45,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:14:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:14:45,081 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-28 03:14:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:45,660 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions. [2021-12-28 03:14:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:14:45,660 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2021-12-28 03:14:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:45,661 INFO L225 Difference]: With dead ends: 191 [2021-12-28 03:14:45,661 INFO L226 Difference]: Without dead ends: 189 [2021-12-28 03:14:45,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:14:45,662 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 87 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:45,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 239 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:14:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-28 03:14:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2021-12-28 03:14:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 138 states have internal predecessors, (150), 24 states have call successors, (24), 13 states have call predecessors, (24), 18 states have return successors, (37), 24 states have call predecessors, (37), 23 states have call successors, (37) [2021-12-28 03:14:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2021-12-28 03:14:45,669 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 66 [2021-12-28 03:14:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:45,670 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2021-12-28 03:14:45,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-28 03:14:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2021-12-28 03:14:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-28 03:14:45,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:45,670 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:45,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 03:14:45,672 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 820275769, now seen corresponding path program 1 times [2021-12-28 03:14:45,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942667419] [2021-12-28 03:14:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:45,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:45,871 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-28 03:14:45,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:45,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942667419] [2021-12-28 03:14:45,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942667419] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:45,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:45,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 03:14:45,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299262972] [2021-12-28 03:14:45,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:45,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 03:14:45,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:45,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 03:14:45,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:14:45,874 INFO L87 Difference]: Start difference. First operand 176 states and 211 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 03:14:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:46,243 INFO L93 Difference]: Finished difference Result 192 states and 228 transitions. [2021-12-28 03:14:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:14:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2021-12-28 03:14:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:46,245 INFO L225 Difference]: With dead ends: 192 [2021-12-28 03:14:46,245 INFO L226 Difference]: Without dead ends: 190 [2021-12-28 03:14:46,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:14:46,246 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 61 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:46,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 366 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:14:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-28 03:14:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2021-12-28 03:14:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 144 states have internal predecessors, (155), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (38), 24 states have call predecessors, (38), 23 states have call successors, (38) [2021-12-28 03:14:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 217 transitions. [2021-12-28 03:14:46,255 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 217 transitions. Word has length 66 [2021-12-28 03:14:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:46,256 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 217 transitions. [2021-12-28 03:14:46,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 03:14:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 217 transitions. [2021-12-28 03:14:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-28 03:14:46,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:46,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:46,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 03:14:46,257 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1521340347, now seen corresponding path program 1 times [2021-12-28 03:14:46,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:46,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354120574] [2021-12-28 03:14:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:46,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 03:14:46,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:46,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354120574] [2021-12-28 03:14:46,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354120574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:46,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367156935] [2021-12-28 03:14:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:46,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:46,576 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-28 03:14:46,577 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-28 03:14:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:46,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-28 03:14:46,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:47,045 INFO L353 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-28 03:14:47,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-28 03:14:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:14:47,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:47,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367156935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:47,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:47,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2021-12-28 03:14:47,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798097515] [2021-12-28 03:14:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:47,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:14:47,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:47,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:14:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-12-28 03:14:47,635 INFO L87 Difference]: Start difference. First operand 182 states and 217 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:47,730 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2021-12-28 03:14:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:14:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2021-12-28 03:14:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:47,732 INFO L225 Difference]: With dead ends: 224 [2021-12-28 03:14:47,732 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 03:14:47,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-12-28 03:14:47,733 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:47,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 800 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2021-12-28 03:14:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 03:14:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2021-12-28 03:14:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 145 states have internal predecessors, (156), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (37), 24 states have call predecessors, (37), 23 states have call successors, (37) [2021-12-28 03:14:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2021-12-28 03:14:47,740 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 66 [2021-12-28 03:14:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:47,741 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2021-12-28 03:14:47,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2021-12-28 03:14:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:14:47,742 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:47,742 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:47,780 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-28 03:14:47,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-28 03:14:47,956 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1978442555, now seen corresponding path program 1 times [2021-12-28 03:14:47,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:47,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540648215] [2021-12-28 03:14:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:47,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 03:14:48,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:48,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540648215] [2021-12-28 03:14:48,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540648215] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:48,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592630180] [2021-12-28 03:14:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:48,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:48,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:14:48,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 03:14:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:48,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-28 03:14:48,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:48,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:48,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-28 03:14:49,288 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 03:14:49,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-12-28 03:14:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-28 03:14:49,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:49,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592630180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:49,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:49,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [22] total 30 [2021-12-28 03:14:49,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138251321] [2021-12-28 03:14:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:49,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:14:49,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:49,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:14:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2021-12-28 03:14:49,324 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-28 03:14:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:49,436 INFO L93 Difference]: Finished difference Result 308 states and 356 transitions. [2021-12-28 03:14:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:14:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2021-12-28 03:14:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:49,438 INFO L225 Difference]: With dead ends: 308 [2021-12-28 03:14:49,438 INFO L226 Difference]: Without dead ends: 191 [2021-12-28 03:14:49,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2021-12-28 03:14:49,439 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 28 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:49,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 480 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2021-12-28 03:14:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-28 03:14:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-12-28 03:14:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 147 states have (on average 1.1224489795918366) internal successors, (165), 153 states have internal predecessors, (165), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (36), 24 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-28 03:14:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2021-12-28 03:14:49,447 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 70 [2021-12-28 03:14:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:49,447 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2021-12-28 03:14:49,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-28 03:14:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2021-12-28 03:14:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:14:49,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:49,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:49,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-28 03:14:49,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:49,672 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1584075769, now seen corresponding path program 1 times [2021-12-28 03:14:49,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:49,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668102072] [2021-12-28 03:14:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:49,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:50,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:14:50,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668102072] [2021-12-28 03:14:50,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668102072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166978517] [2021-12-28 03:14:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:50,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:50,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:50,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:14:50,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 03:14:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:50,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-28 03:14:50,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:50,898 INFO L353 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-28 03:14:50,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-28 03:14:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:14:51,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:51,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166978517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:51,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:51,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [25] total 37 [2021-12-28 03:14:51,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826452502] [2021-12-28 03:14:51,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:51,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:14:51,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:14:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2021-12-28 03:14:51,757 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:51,806 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2021-12-28 03:14:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:14:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2021-12-28 03:14:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:51,808 INFO L225 Difference]: With dead ends: 278 [2021-12-28 03:14:51,808 INFO L226 Difference]: Without dead ends: 227 [2021-12-28 03:14:51,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2021-12-28 03:14:51,809 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 19 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:51,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 833 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 133 Unchecked, 0.0s Time] [2021-12-28 03:14:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-28 03:14:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2021-12-28 03:14:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.1204819277108433) internal successors, (186), 171 states have internal predecessors, (186), 24 states have call successors, (24), 15 states have call predecessors, (24), 20 states have return successors, (33), 24 states have call predecessors, (33), 23 states have call successors, (33) [2021-12-28 03:14:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 243 transitions. [2021-12-28 03:14:51,817 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 243 transitions. Word has length 70 [2021-12-28 03:14:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:51,817 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 243 transitions. [2021-12-28 03:14:51,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 243 transitions. [2021-12-28 03:14:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:14:51,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:51,818 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:51,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 03:14:52,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:52,031 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 304212091, now seen corresponding path program 1 times [2021-12-28 03:14:52,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:52,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879515353] [2021-12-28 03:14:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:52,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 03:14:52,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:52,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879515353] [2021-12-28 03:14:52,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879515353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:52,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:52,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:14:52,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65215918] [2021-12-28 03:14:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:52,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:14:52,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:14:52,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:14:52,408 INFO L87 Difference]: Start difference. First operand 211 states and 243 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-28 03:14:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:52,934 INFO L93 Difference]: Finished difference Result 271 states and 312 transitions. [2021-12-28 03:14:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:14:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2021-12-28 03:14:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:52,935 INFO L225 Difference]: With dead ends: 271 [2021-12-28 03:14:52,936 INFO L226 Difference]: Without dead ends: 230 [2021-12-28 03:14:52,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:14:52,936 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 122 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:52,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 368 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:14:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-28 03:14:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2021-12-28 03:14:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.1151515151515152) internal successors, (184), 172 states have internal predecessors, (184), 24 states have call successors, (24), 15 states have call predecessors, (24), 22 states have return successors, (35), 24 states have call predecessors, (35), 23 states have call successors, (35) [2021-12-28 03:14:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 243 transitions. [2021-12-28 03:14:52,948 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 243 transitions. Word has length 70 [2021-12-28 03:14:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:52,948 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 243 transitions. [2021-12-28 03:14:52,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-28 03:14:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 243 transitions. [2021-12-28 03:14:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:14:52,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:52,949 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, 1, 1, 1, 1] [2021-12-28 03:14:52,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-28 03:14:52,950 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:52,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -262437571, now seen corresponding path program 1 times [2021-12-28 03:14:52,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:52,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537996362] [2021-12-28 03:14:52,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:52,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 03:14:53,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:53,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537996362] [2021-12-28 03:14:53,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537996362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:53,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:53,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:14:53,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832421928] [2021-12-28 03:14:53,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:53,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:14:53,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:53,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:14:53,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:14:53,071 INFO L87 Difference]: Start difference. First operand 212 states and 243 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 03:14:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:53,214 INFO L93 Difference]: Finished difference Result 302 states and 341 transitions. [2021-12-28 03:14:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:14:53,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2021-12-28 03:14:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:53,217 INFO L225 Difference]: With dead ends: 302 [2021-12-28 03:14:53,217 INFO L226 Difference]: Without dead ends: 192 [2021-12-28 03:14:53,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:14:53,218 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:53,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 158 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:14:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-28 03:14:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2021-12-28 03:14:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 143 states have (on average 1.06993006993007) internal successors, (153), 147 states have internal predecessors, (153), 24 states have call successors, (24), 15 states have call predecessors, (24), 19 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2021-12-28 03:14:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2021-12-28 03:14:53,227 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 70 [2021-12-28 03:14:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:53,227 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2021-12-28 03:14:53,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 03:14:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2021-12-28 03:14:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:14:53,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:53,229 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:53,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-28 03:14:53,230 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1542301249, now seen corresponding path program 1 times [2021-12-28 03:14:53,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:53,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91519957] [2021-12-28 03:14:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:53,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 03:14:54,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:54,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91519957] [2021-12-28 03:14:54,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91519957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:14:54,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810473764] [2021-12-28 03:14:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:54,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:14:54,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:14:54,043 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:14:54,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 03:14:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:54,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-28 03:14:54,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:14:54,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:54,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:54,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:14:54,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-28 03:14:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 03:14:55,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:14:55,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810473764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:55,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:14:55,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [22] total 33 [2021-12-28 03:14:55,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014718135] [2021-12-28 03:14:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:55,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:14:55,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:14:55,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-12-28 03:14:55,301 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:55,358 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2021-12-28 03:14:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:14:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2021-12-28 03:14:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:55,360 INFO L225 Difference]: With dead ends: 255 [2021-12-28 03:14:55,360 INFO L226 Difference]: Without dead ends: 209 [2021-12-28 03:14:55,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2021-12-28 03:14:55,361 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 18 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:55,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 532 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 127 Unchecked, 0.0s Time] [2021-12-28 03:14:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-28 03:14:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2021-12-28 03:14:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 144 states have (on average 1.0555555555555556) internal successors, (152), 148 states have internal predecessors, (152), 24 states have call successors, (24), 15 states have call predecessors, (24), 19 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2021-12-28 03:14:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2021-12-28 03:14:55,369 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 70 [2021-12-28 03:14:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:55,369 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2021-12-28 03:14:55,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2021-12-28 03:14:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 03:14:55,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:55,370 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:55,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 03:14:55,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-28 03:14:55,590 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2083530690, now seen corresponding path program 1 times [2021-12-28 03:14:55,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:55,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033223717] [2021-12-28 03:14:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:55,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:14:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:14:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 03:14:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 03:14:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:55,901 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-28 03:14:55,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:55,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033223717] [2021-12-28 03:14:55,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033223717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:55,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:55,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:14:55,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580842033] [2021-12-28 03:14:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:55,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:14:55,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:55,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:14:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:14:55,903 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 03:14:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:56,507 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2021-12-28 03:14:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:14:56,508 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 72 [2021-12-28 03:14:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:56,508 INFO L225 Difference]: With dead ends: 207 [2021-12-28 03:14:56,509 INFO L226 Difference]: Without dead ends: 205 [2021-12-28 03:14:56,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:14:56,509 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 86 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:56,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 239 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:14:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-28 03:14:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2021-12-28 03:14:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.054054054054054) internal successors, (156), 152 states have internal predecessors, (156), 25 states have call successors, (25), 16 states have call predecessors, (25), 20 states have return successors, (31), 25 states have call predecessors, (31), 24 states have call successors, (31) [2021-12-28 03:14:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2021-12-28 03:14:56,519 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 72 [2021-12-28 03:14:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:56,519 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2021-12-28 03:14:56,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 03:14:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2021-12-28 03:14:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:14:56,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:56,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:56,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-28 03:14:56,520 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash 683060159, now seen corresponding path program 1 times [2021-12-28 03:14:56,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:56,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416007162] [2021-12-28 03:14:56,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:56,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 03:14:56,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416007162] [2021-12-28 03:14:56,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416007162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:56,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:56,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:14:56,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577406292] [2021-12-28 03:14:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:56,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:14:56,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:14:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:14:56,816 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:14:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:57,434 INFO L93 Difference]: Finished difference Result 247 states and 271 transitions. [2021-12-28 03:14:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:14:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2021-12-28 03:14:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:57,435 INFO L225 Difference]: With dead ends: 247 [2021-12-28 03:14:57,435 INFO L226 Difference]: Without dead ends: 200 [2021-12-28 03:14:57,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:14:57,436 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 89 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:57,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 232 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:14:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-28 03:14:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2021-12-28 03:14:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 143 states have (on average 1.048951048951049) internal successors, (150), 147 states have internal predecessors, (150), 25 states have call successors, (25), 16 states have call predecessors, (25), 20 states have return successors, (31), 25 states have call predecessors, (31), 24 states have call successors, (31) [2021-12-28 03:14:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-28 03:14:57,446 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 70 [2021-12-28 03:14:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:57,446 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-28 03:14:57,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:14:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-28 03:14:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 03:14:57,447 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:57,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:57,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-28 03:14:57,447 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807610, now seen corresponding path program 1 times [2021-12-28 03:14:57,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:57,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925760188] [2021-12-28 03:14:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:57,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 03:14:57,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:57,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925760188] [2021-12-28 03:14:57,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925760188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:57,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:57,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-28 03:14:57,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163562122] [2021-12-28 03:14:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:57,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-28 03:14:57,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-28 03:14:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2021-12-28 03:14:57,955 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:59,006 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2021-12-28 03:14:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-28 03:14:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2021-12-28 03:14:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:59,008 INFO L225 Difference]: With dead ends: 210 [2021-12-28 03:14:59,008 INFO L226 Difference]: Without dead ends: 208 [2021-12-28 03:14:59,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2021-12-28 03:14:59,013 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 109 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:59,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 632 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 03:14:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-28 03:14:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2021-12-28 03:14:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.047945205479452) internal successors, (153), 150 states have internal predecessors, (153), 24 states have call successors, (24), 17 states have call predecessors, (24), 21 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2021-12-28 03:14:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2021-12-28 03:14:59,023 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 72 [2021-12-28 03:14:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:59,024 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2021-12-28 03:14:59,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:14:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2021-12-28 03:14:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 03:14:59,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:59,025 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:59,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-28 03:14:59,025 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1210932874, now seen corresponding path program 1 times [2021-12-28 03:14:59,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:59,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353975924] [2021-12-28 03:14:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:59,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:14:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:14:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:14:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:14:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 03:14:59,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:14:59,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353975924] [2021-12-28 03:14:59,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353975924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:14:59,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:14:59,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 03:14:59,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666544423] [2021-12-28 03:14:59,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:14:59,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 03:14:59,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:14:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 03:14:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:14:59,296 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:14:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:14:59,840 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2021-12-28 03:14:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 03:14:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2021-12-28 03:14:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:14:59,842 INFO L225 Difference]: With dead ends: 239 [2021-12-28 03:14:59,842 INFO L226 Difference]: Without dead ends: 196 [2021-12-28 03:14:59,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-12-28 03:14:59,842 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:14:59,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 217 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:14:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-28 03:14:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2021-12-28 03:14:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.0425531914893618) internal successors, (147), 144 states have internal predecessors, (147), 23 states have call successors, (23), 17 states have call predecessors, (23), 20 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-28 03:14:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2021-12-28 03:14:59,857 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 72 [2021-12-28 03:14:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:14:59,857 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2021-12-28 03:14:59,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:14:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2021-12-28 03:14:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-28 03:14:59,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:14:59,858 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:14:59,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-28 03:14:59,859 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:14:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:14:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1862370124, now seen corresponding path program 1 times [2021-12-28 03:14:59,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:14:59,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322623840] [2021-12-28 03:14:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:14:59,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:14:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:14:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:14:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:14:59,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:15:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:15:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 03:15:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 03:15:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,094 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-28 03:15:00,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:00,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322623840] [2021-12-28 03:15:00,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322623840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:00,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:00,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 03:15:00,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762036004] [2021-12-28 03:15:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:00,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:15:00,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:00,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:15:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:15:00,097 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:15:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:00,427 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2021-12-28 03:15:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:15:00,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2021-12-28 03:15:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:00,429 INFO L225 Difference]: With dead ends: 191 [2021-12-28 03:15:00,429 INFO L226 Difference]: Without dead ends: 189 [2021-12-28 03:15:00,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:15:00,429 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 74 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:00,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:15:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-28 03:15:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-28 03:15:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.0416666666666667) internal successors, (150), 147 states have internal predecessors, (150), 23 states have call successors, (23), 18 states have call predecessors, (23), 21 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-28 03:15:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2021-12-28 03:15:00,466 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 78 [2021-12-28 03:15:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:00,467 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2021-12-28 03:15:00,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:15:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2021-12-28 03:15:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-28 03:15:00,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:15:00,468 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:00,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-28 03:15:00,468 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:15:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:15:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1313070, now seen corresponding path program 1 times [2021-12-28 03:15:00,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:15:00,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775551119] [2021-12-28 03:15:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:15:00,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:15:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:15:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:15:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:15:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 03:15:00,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775551119] [2021-12-28 03:15:00,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775551119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:00,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:00,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 03:15:00,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750190152] [2021-12-28 03:15:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:00,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:15:00,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:15:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:15:00,941 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-28 03:15:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:01,587 INFO L93 Difference]: Finished difference Result 237 states and 255 transitions. [2021-12-28 03:15:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:15:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 78 [2021-12-28 03:15:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:01,588 INFO L225 Difference]: With dead ends: 237 [2021-12-28 03:15:01,588 INFO L226 Difference]: Without dead ends: 194 [2021-12-28 03:15:01,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:15:01,589 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 129 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:01,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 407 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:15:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-28 03:15:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2021-12-28 03:15:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.0390625) internal successors, (133), 131 states have internal predecessors, (133), 23 states have call successors, (23), 17 states have call predecessors, (23), 20 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-28 03:15:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2021-12-28 03:15:01,602 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 78 [2021-12-28 03:15:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:01,603 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2021-12-28 03:15:01,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-28 03:15:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2021-12-28 03:15:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-28 03:15:01,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:15:01,604 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:01,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-28 03:15:01,604 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:15:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:15:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1589660972, now seen corresponding path program 1 times [2021-12-28 03:15:01,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:15:01,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799587344] [2021-12-28 03:15:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:15:01,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:15:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:15:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:15:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:15:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-28 03:15:01,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799587344] [2021-12-28 03:15:01,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799587344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:01,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:01,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:15:01,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690135995] [2021-12-28 03:15:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:01,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:15:01,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:15:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:15:01,974 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-28 03:15:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:02,529 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2021-12-28 03:15:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:15:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2021-12-28 03:15:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:02,530 INFO L225 Difference]: With dead ends: 189 [2021-12-28 03:15:02,530 INFO L226 Difference]: Without dead ends: 187 [2021-12-28 03:15:02,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:15:02,531 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:02,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 423 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:15:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-28 03:15:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2021-12-28 03:15:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 134 states have internal predecessors, (136), 23 states have call successors, (23), 18 states have call predecessors, (23), 21 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-28 03:15:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2021-12-28 03:15:02,539 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 78 [2021-12-28 03:15:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:02,540 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2021-12-28 03:15:02,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-28 03:15:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2021-12-28 03:15:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-28 03:15:02,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:15:02,540 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:02,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-28 03:15:02,540 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:15:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:15:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1440681711, now seen corresponding path program 1 times [2021-12-28 03:15:02,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:15:02,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521696699] [2021-12-28 03:15:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:15:02,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:15:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:15:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:15:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:15:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 03:15:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 03:15:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:15:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:02,722 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-28 03:15:02,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:02,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521696699] [2021-12-28 03:15:02,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521696699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:02,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:02,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:15:02,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970721058] [2021-12-28 03:15:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:02,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:15:02,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:15:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:15:02,724 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:15:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:03,033 INFO L93 Difference]: Finished difference Result 200 states and 211 transitions. [2021-12-28 03:15:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:15:03,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2021-12-28 03:15:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:03,034 INFO L225 Difference]: With dead ends: 200 [2021-12-28 03:15:03,034 INFO L226 Difference]: Without dead ends: 84 [2021-12-28 03:15:03,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:15:03,034 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:03,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 227 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:15:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-28 03:15:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-28 03:15:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-28 03:15:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-28 03:15:03,040 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 85 [2021-12-28 03:15:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:03,040 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-28 03:15:03,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:15:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-28 03:15:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-28 03:15:03,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:15:03,040 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:03,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-28 03:15:03,041 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:15:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:15:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 61222880, now seen corresponding path program 1 times [2021-12-28 03:15:03,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:15:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036173781] [2021-12-28 03:15:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:15:03,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:15:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:15:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:15:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:15:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:15:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:15:03,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:03,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036173781] [2021-12-28 03:15:03,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036173781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:03,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:03,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:15:03,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028353978] [2021-12-28 03:15:03,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:03,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:15:03,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:03,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:15:03,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:15:03,358 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 03:15:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:03,770 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2021-12-28 03:15:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:15:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2021-12-28 03:15:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:03,771 INFO L225 Difference]: With dead ends: 90 [2021-12-28 03:15:03,771 INFO L226 Difference]: Without dead ends: 88 [2021-12-28 03:15:03,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:15:03,771 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:03,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 195 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:15:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-28 03:15:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-28 03:15:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 62 states have internal predecessors, (62), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-28 03:15:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-12-28 03:15:03,777 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 84 [2021-12-28 03:15:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:03,778 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-12-28 03:15:03,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 03:15:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-12-28 03:15:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-28 03:15:03,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:15:03,779 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:03,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-28 03:15:03,779 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:15:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:15:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795247, now seen corresponding path program 1 times [2021-12-28 03:15:03,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:15:03,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131456885] [2021-12-28 03:15:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:15:03,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:15:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:15:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:15:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:15:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:15:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:15:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 03:15:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:04,068 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-28 03:15:04,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:04,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131456885] [2021-12-28 03:15:04,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131456885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:04,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:04,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-28 03:15:04,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800627070] [2021-12-28 03:15:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:04,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 03:15:04,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 03:15:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:15:04,071 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 03:15:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:04,700 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2021-12-28 03:15:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:15:04,700 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 97 [2021-12-28 03:15:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:04,702 INFO L225 Difference]: With dead ends: 94 [2021-12-28 03:15:04,702 INFO L226 Difference]: Without dead ends: 90 [2021-12-28 03:15:04,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-12-28 03:15:04,703 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 46 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:04,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:15:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-28 03:15:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-28 03:15:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-28 03:15:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2021-12-28 03:15:04,710 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 97 [2021-12-28 03:15:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:04,710 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2021-12-28 03:15:04,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 03:15:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2021-12-28 03:15:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-28 03:15:04,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:15:04,711 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:04,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-28 03:15:04,711 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:15:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:15:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash 654673100, now seen corresponding path program 1 times [2021-12-28 03:15:04,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:15:04,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574457970] [2021-12-28 03:15:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:15:04,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:15:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:15:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:15:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:15:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:15:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:15:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:15:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:15:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:15:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:15:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 03:15:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-28 03:15:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-28 03:15:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-28 03:15:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:15:05,584 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-28 03:15:05,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:15:05,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574457970] [2021-12-28 03:15:05,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574457970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:15:05,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:15:05,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-28 03:15:05,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237663458] [2021-12-28 03:15:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:15:05,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 03:15:05,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:15:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 03:15:05,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-12-28 03:15:05,587 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-28 03:15:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:15:06,099 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2021-12-28 03:15:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 03:15:06,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 114 [2021-12-28 03:15:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:15:06,099 INFO L225 Difference]: With dead ends: 90 [2021-12-28 03:15:06,100 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 03:15:06,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-12-28 03:15:06,100 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:15:06,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 250 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:15:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 03:15:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 03:15:06,101 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-28 03:15:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 03:15:06,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2021-12-28 03:15:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:15:06,101 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 03:15:06,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-28 03:15:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 03:15:06,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 03:15:06,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:15:06,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-28 03:15:06,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 03:15:08,677 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:15:08,677 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,677 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L854 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse12 (select .cse17 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse11 (select .cse17 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16))) (.cse14 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse15 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse13 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse16 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse5 (select .cse13 .cse16)) (.cse1 (select .cse15 .cse16)) (.cse0 (= (select .cse15 .cse14) 0)) (.cse2 (= (select .cse13 .cse14) 0)) (.cse3 (<= .cse12 .cse11)) (.cse4 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse6 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse7 (= |aws_byte_buf_from_array_#in~len| .cse12)) (.cse8 (<= .cse11 .cse12)) (.cse9 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse10 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse0 (= .cse1 |aws_byte_buf_from_array_#in~bytes.offset|) .cse2 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616)) .cse3 .cse4 (= .cse5 |aws_byte_buf_from_array_#in~bytes.base|) .cse6 .cse7 .cse8 .cse9 .cse10) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= .cse5 0) (= .cse1 0) .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (mod aws_byte_buf_from_array_~len 18446744073709551616) 0)))))) [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2021-12-28 03:15:08,678 INFO L854 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse15 (select .cse20 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse14 (select .cse20 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16))) (.cse17 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse18 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse16 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse19 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse7 (select .cse16 .cse19)) (.cse2 (select .cse18 .cse19)) (.cse0 (<= 1 |aws_byte_buf_from_array_#t~ret1053|)) (.cse1 (= (select .cse18 .cse17) 0)) (.cse3 (= (select .cse16 .cse17) 0)) (.cse4 (<= |aws_byte_buf_from_array_#t~ret1053| 1)) (.cse5 (<= .cse15 .cse14)) (.cse6 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse8 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse9 (not (= aws_byte_buf_from_array_~bytes.base 0))) (.cse10 (= |aws_byte_buf_from_array_#in~len| .cse15)) (.cse11 (<= .cse14 .cse15)) (.cse12 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse13 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse0 .cse1 (= .cse2 |aws_byte_buf_from_array_#in~bytes.offset|) .cse3 .cse4 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616)) .cse5 .cse6 (= .cse7 |aws_byte_buf_from_array_#in~bytes.base|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= .cse7 0) (= .cse2 0) .cse0 .cse1 (<= 0 (+ |aws_byte_buf_from_array_#in~len| (* (div (* (- 1) |aws_byte_buf_from_array_#in~len|) 18446744073709551616) 18446744073709551616))) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))))) [2021-12-28 03:15:08,678 INFO L858 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L854 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L854 garLoopResultBuilder]: At program point aws_byte_buf_from_arrayENTRY(lines 8203 8216) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (= |aws_byte_buf_from_array_#in~bytes.base| 0)) [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse3 (select .cse0 .cse4)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (not (= .cse3 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse3) (= (select .cse2 .cse4) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0)))) [2021-12-28 03:15:08,679 INFO L854 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse9 .cse12) 0)) (.cse2 (= (select .cse11 .cse12) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1.base| 0)) (.cse6 (= (select .cse11 .cse10) 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse9 .cse10))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= .cse5 0))))) [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2021-12-28 03:15:08,679 INFO L854 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) [2021-12-28 03:15:08,679 INFO L858 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select .cse14 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse13 .cse15) 0)) (.cse2 (= (select .cse11 .cse15) 0)) (.cse3 (= (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse10 (select .cse13 .cse12)) (.cse5 (= (select .cse11 .cse12) 0)) (.cse6 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1211#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 (* (div .cse9 18446744073709551616) 18446744073709551616)) (= .cse10 0)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse10) .cse5 .cse6 .cse7 .cse8 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)))))) [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse3 (select .cse0 .cse4)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (not (= .cse3 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse3) (= (select .cse2 .cse4) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0)))) [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L861 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L854 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse13 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse10 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)) (.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse11 .cse15) 0)) (.cse2 (= (select .cse14 .cse15) 0)) (.cse3 (= (select .cse13 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse14 .cse12) 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse7 (select .cse13 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse5 (select .cse11 .cse12)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse8 .cse9 (<= (+ .cse10 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 (<= .cse7 (* (div .cse7 18446744073709551616) 18446744073709551616)) (= .cse5 0) .cse9)))) [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse3 (select .cse0 .cse4)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (not (= .cse3 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse3) (= (select .cse2 .cse4) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0)))) [2021-12-28 03:15:08,680 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-12-28 03:15:08,680 INFO L858 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2021-12-28 03:15:08,680 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse3 (select .cse0 .cse4)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (not (= .cse3 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse3) (= (select .cse2 .cse4) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0)))) [2021-12-28 03:15:08,681 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse7 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse9 (select .cse17 .cse15)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse17 .cse16) 0)) (.cse1 (= (select .cse14 .cse16) 0)) (.cse8 (= .cse9 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= (select .cse14 .cse15) 0)) (.cse5 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 .cse4 .cse5 .cse6 (<= .cse7 (* (div .cse7 18446744073709551616) 18446744073709551616)) .cse8) (and .cse0 .cse1 (not .cse8) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse9) .cse4 .cse5 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_15| Int)) (let ((.cse13 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_15|))) (let ((.cse10 (select .cse13 0)) (.cse11 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (select .cse13 16))) (and (= .cse10 (select .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (= .cse10 .cse12) (= (select .cse11 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) .cse12))))) .cse6 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)))))) [2021-12-28 03:15:08,681 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse14 .cse16) 0)) (.cse2 (= (select .cse12 .cse16) 0)) (.cse3 (= (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse10 (select .cse14 .cse13)) (.cse5 (= (select .cse12 .cse13) 0)) (.cse6 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse7 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1210#1| 1)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse11 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1210#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 (* (div .cse9 18446744073709551616) 18446744073709551616)) (= .cse10 0) .cse11) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse10) .cse5 .cse6 .cse7 .cse8 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse11))))) [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-28 03:15:08,681 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:15:08,681 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-28 03:15:08,684 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:15:08,685 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:15:08,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:15:08 BoogieIcfgContainer [2021-12-28 03:15:08,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:15:08,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:15:08,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:15:08,693 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:15:08,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:14:28" (3/4) ... [2021-12-28 03:15:08,695 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 03:15:08,699 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-28 03:15:08,699 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2021-12-28 03:15:08,699 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-28 03:15:08,699 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-28 03:15:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-28 03:15:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-28 03:15:08,707 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2021-12-28 03:15:08,708 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-12-28 03:15:08,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-28 03:15:08,710 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-12-28 03:15:08,710 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-28 03:15:08,711 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-28 03:15:08,712 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 03:15:08,712 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 03:15:09,255 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 03:15:09,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:15:09,256 INFO L158 Benchmark]: Toolchain (without parser) took 43594.91ms. Allocated memory was 60.8MB in the beginning and 641.7MB in the end (delta: 580.9MB). Free memory was 32.4MB in the beginning and 526.8MB in the end (delta: -494.4MB). Peak memory consumption was 417.5MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,256 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:15:09,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1724.16ms. Allocated memory was 60.8MB in the beginning and 100.7MB in the end (delta: 39.8MB). Free memory was 32.2MB in the beginning and 41.2MB in the end (delta: -9.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.30ms. Allocated memory is still 100.7MB. Free memory was 41.2MB in the beginning and 51.5MB in the end (delta: -10.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,256 INFO L158 Benchmark]: Boogie Preprocessor took 78.56ms. Allocated memory is still 100.7MB. Free memory was 51.5MB in the beginning and 45.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,256 INFO L158 Benchmark]: RCFGBuilder took 982.55ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 45.3MB in the beginning and 87.0MB in the end (delta: -41.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,256 INFO L158 Benchmark]: TraceAbstraction took 40118.37ms. Allocated memory was 130.0MB in the beginning and 641.7MB in the end (delta: 511.7MB). Free memory was 87.0MB in the beginning and 589.3MB in the end (delta: -502.3MB). Peak memory consumption was 390.2MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,257 INFO L158 Benchmark]: Witness Printer took 563.01ms. Allocated memory is still 641.7MB. Free memory was 589.3MB in the beginning and 526.8MB in the end (delta: 62.5MB). Peak memory consumption was 392.8MB. Max. memory is 16.1GB. [2021-12-28 03:15:09,257 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.15ms. Allocated memory is still 60.8MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1724.16ms. Allocated memory was 60.8MB in the beginning and 100.7MB in the end (delta: 39.8MB). Free memory was 32.2MB in the beginning and 41.2MB in the end (delta: -9.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.30ms. Allocated memory is still 100.7MB. Free memory was 41.2MB in the beginning and 51.5MB in the end (delta: -10.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.56ms. Allocated memory is still 100.7MB. Free memory was 51.5MB in the beginning and 45.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 982.55ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 45.3MB in the beginning and 87.0MB in the end (delta: -41.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40118.37ms. Allocated memory was 130.0MB in the beginning and 641.7MB in the end (delta: 511.7MB). Free memory was 87.0MB in the beginning and 589.3MB in the end (delta: -502.3MB). Peak memory consumption was 390.2MB. Max. memory is 16.1GB. * Witness Printer took 563.01ms. Allocated memory is still 641.7MB. Free memory was 589.3MB in the beginning and 526.8MB in the end (delta: 62.5MB). Peak memory consumption was 392.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 39, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2964 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2759 mSDsluCounter, 13393 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 770 IncrementalHoareTripleChecker+Unchecked, 10449 mSDsCounter, 1026 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15728 IncrementalHoareTripleChecker+Invalid, 17524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1026 mSolverCounterUnsat, 2944 mSDtfsCounter, 15728 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1656 GetRequests, 977 SyntacticMatches, 17 SemanticMatches, 662 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=26, InterpolantAutomatonStates: 445, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 376 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 288 PreInvPairs, 310 NumberOfFragments, 1649 HoareAnnotationTreeSize, 288 FomulaSimplifications, 5316 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 207892 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 2895 NumberOfCodeBlocks, 2895 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2848 ConstructedInterpolants, 216 QuantifiedInterpolants, 18190 SizeOfPredicates, 81 NumberOfNonLiveVariables, 20017 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 47 InterpolantComputations, 39 PerfectInterpolantSequences, 868/918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-28 03:15:09,276 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