./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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_cursor_left_trim_pred_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 df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:48:56,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:48:56,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:48:56,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:48:56,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:48:56,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:48:56,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:48:56,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:48:56,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:48:56,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:48:56,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:48:56,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:48:56,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:48:56,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:48:56,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:48:56,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:48:56,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:48:56,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:48:56,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:48:56,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:48:56,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:48:56,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:48:56,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:48:56,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:48:56,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:48:56,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:48:56,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:48:56,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:48:56,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:48:56,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:48:56,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:48:56,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:48:56,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:48:56,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:48:56,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:48:56,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:48:56,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:48:56,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:48:56,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:48:56,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:48:56,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:48:56,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:48:56,406 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:48:56,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:48:56,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:48:56,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:48:56,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:48:56,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:48:56,407 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:48:56,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:48:56,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:48:56,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:48:56,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:48:56,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:48:56,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:48:56,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:48:56,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:48:56,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:48:56,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:48:56,411 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 -> df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 [2021-11-22 19:48:56,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:48:56,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:48:56,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:48:56,667 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:48:56,669 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:48:56,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-22 19:48:56,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59273841f/b97c2c6eaebd426fb50b3f0b70eb8bc3/FLAGb30d824c3 [2021-11-22 19:48:57,309 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:48:57,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-22 19:48:57,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59273841f/b97c2c6eaebd426fb50b3f0b70eb8bc3/FLAGb30d824c3 [2021-11-22 19:48:57,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59273841f/b97c2c6eaebd426fb50b3f0b70eb8bc3 [2021-11-22 19:48:57,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:48:57,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:48:57,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:48:57,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:48:57,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:48:57,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:48:57" (1/1) ... [2021-11-22 19:48:57,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eda6c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:57, skipping insertion in model container [2021-11-22 19:48:57,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:48:57" (1/1) ... [2021-11-22 19:48:57,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:48:57,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:48:57,766 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_cursor_left_trim_pred_harness.i[4504,4517] [2021-11-22 19:48:57,772 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_cursor_left_trim_pred_harness.i[4564,4577] [2021-11-22 19:48:58,307 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,310 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,311 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,311 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,313 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,323 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,324 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,506 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:48:58,513 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:48:58,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:48:58,515 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:48:58,519 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:48:58,521 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:48:58,522 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:48:58,523 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:48:58,525 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:48:58,526 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:48:58,638 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:48:58,749 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,749 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:48:58,913 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:48:58,934 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_cursor_left_trim_pred_harness.i[4504,4517] [2021-11-22 19:48:58,935 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_cursor_left_trim_pred_harness.i[4564,4577] [2021-11-22 19:48:58,963 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,966 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,967 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,971 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,971 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,972 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:58,973 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:59,006 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:48:59,007 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:48:59,007 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:48:59,008 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:48:59,008 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:48:59,009 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:48:59,009 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:48:59,010 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:48:59,010 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:48:59,010 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:48:59,033 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:48:59,078 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:59,078 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:48:59,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:48:59,272 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:48:59,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59 WrapperNode [2021-11-22 19:48:59,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:48:59,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:48:59,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:48:59,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:48:59,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,426 INFO L137 Inliner]: procedures = 690, calls = 2620, calls flagged for inlining = 951, calls inlined = 30, statements flattened = 1115 [2021-11-22 19:48:59,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:48:59,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:48:59,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:48:59,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:48:59,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:48:59,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:48:59,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:48:59,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:48:59,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (1/1) ... [2021-11-22 19:48:59,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:48:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:48:59,556 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-11-22 19:48:59,630 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-11-22 19:48:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:48:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:48:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:48:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:48:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:48:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:48:59,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:48:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:48:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:48:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:48:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:48:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:48:59,858 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:48:59,860 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:49:00,540 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:49:00,545 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:49:00,545 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 19:49:00,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:49:00 BoogieIcfgContainer [2021-11-22 19:49:00,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:49:00,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:49:00,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:49:00,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:49:00,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:48:57" (1/3) ... [2021-11-22 19:49:00,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa64551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:49:00, skipping insertion in model container [2021-11-22 19:49:00,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:48:59" (2/3) ... [2021-11-22 19:49:00,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa64551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:49:00, skipping insertion in model container [2021-11-22 19:49:00,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:49:00" (3/3) ... [2021-11-22 19:49:00,552 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_left_trim_pred_harness.i [2021-11-22 19:49:00,555 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:49:00,555 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 19:49:00,584 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:49:00,588 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-11-22 19:49:00,589 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 19:49:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 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-11-22 19:49:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 19:49:00,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:00,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:00,604 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-22 19:49:00,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:00,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62565619] [2021-11-22 19:49:00,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:00,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:00,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:00,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62565619] [2021-11-22 19:49:00,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62565619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:00,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:00,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:49:00,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231775981] [2021-11-22 19:49:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:00,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:49:00,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:49:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:49:00,972 INFO L87 Difference]: Start difference. First operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 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) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-22 19:49:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:00,989 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2021-11-22 19:49:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:49:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) Word has length 30 [2021-11-22 19:49:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:00,996 INFO L225 Difference]: With dead ends: 244 [2021-11-22 19:49:00,996 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:49:00,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:49:01,006 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:01,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:49:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:49:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-22 19:49:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 116 states have internal predecessors, (150), 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-11-22 19:49:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2021-11-22 19:49:01,033 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 30 [2021-11-22 19:49:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:01,033 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2021-11-22 19:49:01,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-22 19:49:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2021-11-22 19:49:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 19:49:01,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:01,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:01,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:49:01,035 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-22 19:49:01,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:01,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435855924] [2021-11-22 19:49:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:01,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:01,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435855924] [2021-11-22 19:49:01,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435855924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:01,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:01,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:49:01,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975788619] [2021-11-22 19:49:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:01,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:49:01,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:01,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:49:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:49:01,218 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11-22 19:49:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:01,294 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2021-11-22 19:49:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:49:01,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) Word has length 32 [2021-11-22 19:49:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:01,297 INFO L225 Difference]: With dead ends: 213 [2021-11-22 19:49:01,298 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:49:01,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:49:01,300 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 134 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:01,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 187 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:49:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:49:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-22 19:49:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3125) internal successors, (147), 116 states have internal predecessors, (147), 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-11-22 19:49:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-11-22 19:49:01,314 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 32 [2021-11-22 19:49:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:01,315 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-11-22 19:49:01,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11-22 19:49:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-11-22 19:49:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:49:01,317 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:01,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:01,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:49:01,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-22 19:49:01,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:01,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020341450] [2021-11-22 19:49:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:01,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:01,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:01,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020341450] [2021-11-22 19:49:01,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020341450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:01,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:01,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:49:01,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170899716] [2021-11-22 19:49:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:01,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:49:01,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:49:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:49:01,519 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-11-22 19:49:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:01,578 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2021-11-22 19:49:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:49:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:49:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:01,579 INFO L225 Difference]: With dead ends: 174 [2021-11-22 19:49:01,579 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:49:01,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:49:01,580 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 579 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:01,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 215 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:49:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:49:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-22 19:49:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 116 states have internal predecessors, (146), 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-11-22 19:49:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-11-22 19:49:01,586 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 36 [2021-11-22 19:49:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:01,587 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-11-22 19:49:01,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-11-22 19:49:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-11-22 19:49:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:49:01,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:01,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:01,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:49:01,588 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-22 19:49:01,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:01,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341537386] [2021-11-22 19:49:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:01,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:01,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:01,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341537386] [2021-11-22 19:49:01,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341537386] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:01,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:01,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:49:01,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235873992] [2021-11-22 19:49:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:01,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:49:01,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:01,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:49:01,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:49:01,740 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-22 19:49:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:01,901 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2021-11-22 19:49:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:49:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) Word has length 38 [2021-11-22 19:49:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:01,902 INFO L225 Difference]: With dead ends: 216 [2021-11-22 19:49:01,902 INFO L226 Difference]: Without dead ends: 208 [2021-11-22 19:49:01,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:49:01,903 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 176 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:01,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 570 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-22 19:49:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2021-11-22 19:49:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.265625) internal successors, (162), 132 states have internal predecessors, (162), 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-11-22 19:49:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-11-22 19:49:01,911 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2021-11-22 19:49:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:01,911 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-11-22 19:49:01,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-22 19:49:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-11-22 19:49:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 19:49:01,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:01,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:01,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:49:01,913 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-22 19:49:01,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:01,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206701536] [2021-11-22 19:49:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:01,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:02,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:02,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206701536] [2021-11-22 19:49:02,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206701536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:02,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:02,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:49:02,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749922793] [2021-11-22 19:49:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:02,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:49:02,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:49:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:02,153 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-11-22 19:49:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:02,689 INFO L93 Difference]: Finished difference Result 399 states and 482 transitions. [2021-11-22 19:49:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:49:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) Word has length 42 [2021-11-22 19:49:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:02,691 INFO L225 Difference]: With dead ends: 399 [2021-11-22 19:49:02,691 INFO L226 Difference]: Without dead ends: 292 [2021-11-22 19:49:02,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:49:02,692 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 531 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:02,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 701 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:49:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-22 19:49:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-22 19:49:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 206 states have internal predecessors, (251), 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-11-22 19:49:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-11-22 19:49:02,705 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 42 [2021-11-22 19:49:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:02,705 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-11-22 19:49:02,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-11-22 19:49:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-11-22 19:49:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-22 19:49:02,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:02,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:02,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:49:02,707 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-22 19:49:02,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:02,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250171133] [2021-11-22 19:49:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:02,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:02,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250171133] [2021-11-22 19:49:02,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250171133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:02,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:02,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:49:02,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699152147] [2021-11-22 19:49:02,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:02,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:49:02,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:02,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:49:02,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:49:02,864 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-11-22 19:49:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:02,897 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-11-22 19:49:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:49:02,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) Word has length 43 [2021-11-22 19:49:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:02,899 INFO L225 Difference]: With dead ends: 264 [2021-11-22 19:49:02,899 INFO L226 Difference]: Without dead ends: 207 [2021-11-22 19:49:02,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:49:02,901 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:02,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 286 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:49:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-22 19:49:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-22 19:49:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 206 states have internal predecessors, (249), 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-11-22 19:49:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2021-11-22 19:49:02,917 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 43 [2021-11-22 19:49:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:02,917 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2021-11-22 19:49:02,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-11-22 19:49:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2021-11-22 19:49:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 19:49:02,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:02,921 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:02,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:49:02,922 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-22 19:49:02,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:02,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068840432] [2021-11-22 19:49:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:02,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:03,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068840432] [2021-11-22 19:49:03,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068840432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:03,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:03,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 19:49:03,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39937259] [2021-11-22 19:49:03,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:03,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 19:49:03,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 19:49:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 19:49:03,037 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-22 19:49:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:03,049 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2021-11-22 19:49:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 19:49:03,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) Word has length 45 [2021-11-22 19:49:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:03,051 INFO L225 Difference]: With dead ends: 298 [2021-11-22 19:49:03,051 INFO L226 Difference]: Without dead ends: 210 [2021-11-22 19:49:03,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-22 19:49:03,053 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:03,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:49:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-22 19:49:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-22 19:49:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 209 states have internal predecessors, (252), 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-11-22 19:49:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2021-11-22 19:49:03,065 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 45 [2021-11-22 19:49:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:03,066 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2021-11-22 19:49:03,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-22 19:49:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2021-11-22 19:49:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 19:49:03,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:03,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:03,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:49:03,071 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-22 19:49:03,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:03,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313959573] [2021-11-22 19:49:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:03,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:03,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:03,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313959573] [2021-11-22 19:49:03,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313959573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:03,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:03,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:49:03,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291784459] [2021-11-22 19:49:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:03,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:49:03,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:49:03,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:49:03,253 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-11-22 19:49:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:03,419 INFO L93 Difference]: Finished difference Result 433 states and 511 transitions. [2021-11-22 19:49:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:49:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) Word has length 46 [2021-11-22 19:49:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:03,420 INFO L225 Difference]: With dead ends: 433 [2021-11-22 19:49:03,420 INFO L226 Difference]: Without dead ends: 262 [2021-11-22 19:49:03,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:49:03,421 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 84 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:03,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-22 19:49:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 210. [2021-11-22 19:49:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 209 states have internal predecessors, (250), 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-11-22 19:49:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2021-11-22 19:49:03,427 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 46 [2021-11-22 19:49:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:03,428 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2021-11-22 19:49:03,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-11-22 19:49:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2021-11-22 19:49:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-22 19:49:03,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:03,429 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-22 19:49:03,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:49:03,429 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-22 19:49:03,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:03,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585869053] [2021-11-22 19:49:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:03,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:49:03,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585869053] [2021-11-22 19:49:03,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585869053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:03,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:03,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:49:03,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352888494] [2021-11-22 19:49:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:03,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:49:03,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:49:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:03,617 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-11-22 19:49:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:03,961 INFO L93 Difference]: Finished difference Result 412 states and 485 transitions. [2021-11-22 19:49:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:49:03,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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) Word has length 47 [2021-11-22 19:49:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:03,963 INFO L225 Difference]: With dead ends: 412 [2021-11-22 19:49:03,963 INFO L226 Difference]: Without dead ends: 292 [2021-11-22 19:49:03,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:49:03,964 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 623 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:03,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 591 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-22 19:49:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-22 19:49:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2128712871287128) internal successors, (245), 206 states have internal predecessors, (245), 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-11-22 19:49:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 245 transitions. [2021-11-22 19:49:03,970 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 245 transitions. Word has length 47 [2021-11-22 19:49:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:03,970 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 245 transitions. [2021-11-22 19:49:03,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-11-22 19:49:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 245 transitions. [2021-11-22 19:49:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 19:49:03,971 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:03,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:03,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:49:03,971 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash 93394749, now seen corresponding path program 1 times [2021-11-22 19:49:03,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:03,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143975760] [2021-11-22 19:49:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:03,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:04,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:04,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143975760] [2021-11-22 19:49:04,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143975760] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:04,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:04,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:49:04,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968987023] [2021-11-22 19:49:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:04,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:49:04,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:04,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:49:04,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:49:04,084 INFO L87 Difference]: Start difference. First operand 207 states and 245 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-22 19:49:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:04,314 INFO L93 Difference]: Finished difference Result 400 states and 473 transitions. [2021-11-22 19:49:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:49:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) Word has length 48 [2021-11-22 19:49:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:04,316 INFO L225 Difference]: With dead ends: 400 [2021-11-22 19:49:04,316 INFO L226 Difference]: Without dead ends: 233 [2021-11-22 19:49:04,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:49:04,317 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 103 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:04,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 328 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-22 19:49:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2021-11-22 19:49:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.1732673267326732) internal successors, (237), 206 states have internal predecessors, (237), 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-11-22 19:49:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 237 transitions. [2021-11-22 19:49:04,323 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 237 transitions. Word has length 48 [2021-11-22 19:49:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:04,323 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 237 transitions. [2021-11-22 19:49:04,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-22 19:49:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 237 transitions. [2021-11-22 19:49:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 19:49:04,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:04,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:04,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:49:04,324 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2144378747, now seen corresponding path program 1 times [2021-11-22 19:49:04,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:04,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942636764] [2021-11-22 19:49:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:04,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:04,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942636764] [2021-11-22 19:49:04,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942636764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:04,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:04,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:49:04,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749848019] [2021-11-22 19:49:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:04,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:49:04,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:49:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:49:04,485 INFO L87 Difference]: Start difference. First operand 207 states and 237 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-11-22 19:49:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:04,988 INFO L93 Difference]: Finished difference Result 542 states and 620 transitions. [2021-11-22 19:49:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:49:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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) Word has length 48 [2021-11-22 19:49:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:04,991 INFO L225 Difference]: With dead ends: 542 [2021-11-22 19:49:04,991 INFO L226 Difference]: Without dead ends: 478 [2021-11-22 19:49:04,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:49:04,992 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 524 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:04,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 689 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:49:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-22 19:49:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 193. [2021-11-22 19:49:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.1648936170212767) internal successors, (219), 192 states have internal predecessors, (219), 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-11-22 19:49:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2021-11-22 19:49:04,998 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 48 [2021-11-22 19:49:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:04,999 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2021-11-22 19:49:04,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-11-22 19:49:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2021-11-22 19:49:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-22 19:49:05,025 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:05,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:05,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:49:05,025 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:05,026 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-22 19:49:05,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:05,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242745702] [2021-11-22 19:49:05,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:05,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:05,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:05,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242745702] [2021-11-22 19:49:05,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242745702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:05,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:05,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:49:05,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210276798] [2021-11-22 19:49:05,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:05,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:49:05,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:49:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:49:05,133 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-11-22 19:49:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:05,284 INFO L93 Difference]: Finished difference Result 353 states and 402 transitions. [2021-11-22 19:49:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:49:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) Word has length 49 [2021-11-22 19:49:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:05,285 INFO L225 Difference]: With dead ends: 353 [2021-11-22 19:49:05,285 INFO L226 Difference]: Without dead ends: 193 [2021-11-22 19:49:05,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:49:05,285 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:05,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-22 19:49:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-11-22 19:49:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.127659574468085) internal successors, (212), 192 states have internal predecessors, (212), 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-11-22 19:49:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2021-11-22 19:49:05,291 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 49 [2021-11-22 19:49:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:05,291 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2021-11-22 19:49:05,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-11-22 19:49:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2021-11-22 19:49:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-22 19:49:05,292 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:05,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:05,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:49:05,293 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 190279064, now seen corresponding path program 1 times [2021-11-22 19:49:05,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:05,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495737885] [2021-11-22 19:49:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:05,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:05,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:05,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495737885] [2021-11-22 19:49:05,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495737885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:05,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:05,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:49:05,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277805867] [2021-11-22 19:49:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:05,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:49:05,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:05,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:49:05,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:49:05,475 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-11-22 19:49:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:05,958 INFO L93 Difference]: Finished difference Result 313 states and 339 transitions. [2021-11-22 19:49:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:49:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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) Word has length 49 [2021-11-22 19:49:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:05,960 INFO L225 Difference]: With dead ends: 313 [2021-11-22 19:49:05,960 INFO L226 Difference]: Without dead ends: 268 [2021-11-22 19:49:05,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:49:05,961 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 513 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:05,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 551 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:49:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-22 19:49:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 204. [2021-11-22 19:49:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.120603015075377) internal successors, (223), 203 states have internal predecessors, (223), 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-11-22 19:49:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2021-11-22 19:49:05,967 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 49 [2021-11-22 19:49:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:05,967 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2021-11-22 19:49:05,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-11-22 19:49:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2021-11-22 19:49:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 19:49:05,968 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:05,968 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-22 19:49:05,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:49:05,968 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 482349700, now seen corresponding path program 1 times [2021-11-22 19:49:05,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:05,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846357737] [2021-11-22 19:49:05,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:05,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:49:06,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:06,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846357737] [2021-11-22 19:49:06,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846357737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:06,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:06,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:49:06,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946026793] [2021-11-22 19:49:06,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:06,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:49:06,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:06,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:49:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:49:06,139 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-11-22 19:49:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:06,509 INFO L93 Difference]: Finished difference Result 603 states and 662 transitions. [2021-11-22 19:49:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:49:06,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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) Word has length 53 [2021-11-22 19:49:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:06,510 INFO L225 Difference]: With dead ends: 603 [2021-11-22 19:49:06,510 INFO L226 Difference]: Without dead ends: 483 [2021-11-22 19:49:06,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:49:06,511 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 953 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:06,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 451 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-22 19:49:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 201. [2021-11-22 19:49:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.1122448979591837) internal successors, (218), 200 states have internal predecessors, (218), 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-11-22 19:49:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2021-11-22 19:49:06,517 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 53 [2021-11-22 19:49:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:06,518 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2021-11-22 19:49:06,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-11-22 19:49:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2021-11-22 19:49:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 19:49:06,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:06,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:06,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:49:06,518 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1409745750, now seen corresponding path program 1 times [2021-11-22 19:49:06,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:06,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071030818] [2021-11-22 19:49:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:06,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:06,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:06,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071030818] [2021-11-22 19:49:06,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071030818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:06,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:06,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:49:06,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944975561] [2021-11-22 19:49:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:06,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:49:06,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:49:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:49:06,697 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-11-22 19:49:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:07,088 INFO L93 Difference]: Finished difference Result 566 states and 618 transitions. [2021-11-22 19:49:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:49:07,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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) Word has length 54 [2021-11-22 19:49:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:07,090 INFO L225 Difference]: With dead ends: 566 [2021-11-22 19:49:07,090 INFO L226 Difference]: Without dead ends: 482 [2021-11-22 19:49:07,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:49:07,091 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 774 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:07,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 665 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:49:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-11-22 19:49:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 203. [2021-11-22 19:49:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 202 states have internal predecessors, (220), 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-11-22 19:49:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2021-11-22 19:49:07,100 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 54 [2021-11-22 19:49:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:07,100 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2021-11-22 19:49:07,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-11-22 19:49:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2021-11-22 19:49:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 19:49:07,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:07,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:07,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:49:07,101 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937159, now seen corresponding path program 1 times [2021-11-22 19:49:07,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:07,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544583379] [2021-11-22 19:49:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:07,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:07,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:07,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544583379] [2021-11-22 19:49:07,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544583379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:07,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:07,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:49:07,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474408219] [2021-11-22 19:49:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:07,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:49:07,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:07,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:49:07,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:07,263 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-11-22 19:49:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:07,798 INFO L93 Difference]: Finished difference Result 502 states and 544 transitions. [2021-11-22 19:49:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:49:07,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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) Word has length 55 [2021-11-22 19:49:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:07,800 INFO L225 Difference]: With dead ends: 502 [2021-11-22 19:49:07,800 INFO L226 Difference]: Without dead ends: 457 [2021-11-22 19:49:07,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-22 19:49:07,801 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 915 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:07,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 483 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:49:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-22 19:49:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 173. [2021-11-22 19:49:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 172 states have internal predecessors, (187), 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-11-22 19:49:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2021-11-22 19:49:07,806 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 55 [2021-11-22 19:49:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:07,807 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2021-11-22 19:49:07,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-11-22 19:49:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2021-11-22 19:49:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 19:49:07,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:07,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:07,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:49:07,807 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-22 19:49:07,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:07,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191320113] [2021-11-22 19:49:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:07,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:08,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:08,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191320113] [2021-11-22 19:49:08,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191320113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:08,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:08,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:49:08,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9949034] [2021-11-22 19:49:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:08,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:49:08,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:49:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:08,031 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 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-11-22 19:49:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:08,262 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2021-11-22 19:49:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:49:08,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 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) Word has length 56 [2021-11-22 19:49:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:08,263 INFO L225 Difference]: With dead ends: 393 [2021-11-22 19:49:08,263 INFO L226 Difference]: Without dead ends: 243 [2021-11-22 19:49:08,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:49:08,264 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 293 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:08,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 540 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-22 19:49:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 177. [2021-11-22 19:49:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1104651162790697) internal successors, (191), 176 states have internal predecessors, (191), 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-11-22 19:49:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2021-11-22 19:49:08,270 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 56 [2021-11-22 19:49:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:08,270 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2021-11-22 19:49:08,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 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-11-22 19:49:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2021-11-22 19:49:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-22 19:49:08,271 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:08,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:08,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:49:08,271 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1309942923, now seen corresponding path program 1 times [2021-11-22 19:49:08,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:08,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937409852] [2021-11-22 19:49:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:08,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:08,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:08,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937409852] [2021-11-22 19:49:08,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937409852] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:08,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:08,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:49:08,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218786751] [2021-11-22 19:49:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:08,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:49:08,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:08,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:49:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:49:08,354 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-11-22 19:49:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:08,378 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2021-11-22 19:49:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:49:08,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) Word has length 58 [2021-11-22 19:49:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:08,379 INFO L225 Difference]: With dead ends: 188 [2021-11-22 19:49:08,380 INFO L226 Difference]: Without dead ends: 177 [2021-11-22 19:49:08,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:49:08,380 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 116 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:08,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 212 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:49:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-22 19:49:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-22 19:49:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1046511627906976) internal successors, (190), 176 states have internal predecessors, (190), 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-11-22 19:49:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2021-11-22 19:49:08,386 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 58 [2021-11-22 19:49:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:08,386 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2021-11-22 19:49:08,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-11-22 19:49:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2021-11-22 19:49:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 19:49:08,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:08,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:08,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:49:08,388 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-22 19:49:08,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:08,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470266485] [2021-11-22 19:49:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:08,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:08,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:08,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470266485] [2021-11-22 19:49:08,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470266485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:08,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:08,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:49:08,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165742899] [2021-11-22 19:49:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:08,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:49:08,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:49:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:49:08,798 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-11-22 19:49:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:09,529 INFO L93 Difference]: Finished difference Result 454 states and 486 transitions. [2021-11-22 19:49:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:49:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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) Word has length 59 [2021-11-22 19:49:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:09,530 INFO L225 Difference]: With dead ends: 454 [2021-11-22 19:49:09,530 INFO L226 Difference]: Without dead ends: 319 [2021-11-22 19:49:09,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:49:09,531 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 697 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:09,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 734 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:49:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-11-22 19:49:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 177. [2021-11-22 19:49:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 176 states have internal predecessors, (189), 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-11-22 19:49:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2021-11-22 19:49:09,540 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 59 [2021-11-22 19:49:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:09,541 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2021-11-22 19:49:09,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-11-22 19:49:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2021-11-22 19:49:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 19:49:09,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:09,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:09,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:49:09,542 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-22 19:49:09,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:09,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874348502] [2021-11-22 19:49:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:09,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:10,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874348502] [2021-11-22 19:49:10,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874348502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:10,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:10,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:49:10,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408490802] [2021-11-22 19:49:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:10,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:49:10,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:49:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:49:10,056 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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-11-22 19:49:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:10,832 INFO L93 Difference]: Finished difference Result 428 states and 454 transitions. [2021-11-22 19:49:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:49:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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) Word has length 62 [2021-11-22 19:49:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:10,834 INFO L225 Difference]: With dead ends: 428 [2021-11-22 19:49:10,834 INFO L226 Difference]: Without dead ends: 357 [2021-11-22 19:49:10,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2021-11-22 19:49:10,835 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 724 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:10,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 1739 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:49:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-22 19:49:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 221. [2021-11-22 19:49:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 220 states have internal predecessors, (240), 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-11-22 19:49:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2021-11-22 19:49:10,845 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 62 [2021-11-22 19:49:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:10,846 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2021-11-22 19:49:10,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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-11-22 19:49:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2021-11-22 19:49:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 19:49:10,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:10,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:10,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:49:10,847 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1831062709, now seen corresponding path program 1 times [2021-11-22 19:49:10,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:10,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469606174] [2021-11-22 19:49:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:10,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:11,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:11,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469606174] [2021-11-22 19:49:11,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469606174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:11,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:11,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:49:11,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569632385] [2021-11-22 19:49:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:11,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:49:11,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:11,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:49:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:49:11,055 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-11-22 19:49:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:11,294 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2021-11-22 19:49:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:49:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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) Word has length 64 [2021-11-22 19:49:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:11,296 INFO L225 Difference]: With dead ends: 278 [2021-11-22 19:49:11,296 INFO L226 Difference]: Without dead ends: 268 [2021-11-22 19:49:11,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:11,296 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 66 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:11,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 471 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-22 19:49:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2021-11-22 19:49:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 265 states have internal predecessors, (286), 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-11-22 19:49:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2021-11-22 19:49:11,309 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 64 [2021-11-22 19:49:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:11,309 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2021-11-22 19:49:11,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-11-22 19:49:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2021-11-22 19:49:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 19:49:11,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:11,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:11,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:49:11,311 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2002093992, now seen corresponding path program 1 times [2021-11-22 19:49:11,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:11,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394179455] [2021-11-22 19:49:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:11,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:11,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:11,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394179455] [2021-11-22 19:49:11,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394179455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:11,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:11,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:49:11,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063727774] [2021-11-22 19:49:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:11,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:49:11,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:11,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:49:11,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:49:11,548 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-11-22 19:49:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:12,292 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2021-11-22 19:49:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:49:12,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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) Word has length 64 [2021-11-22 19:49:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:12,295 INFO L225 Difference]: With dead ends: 293 [2021-11-22 19:49:12,295 INFO L226 Difference]: Without dead ends: 233 [2021-11-22 19:49:12,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2021-11-22 19:49:12,296 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 402 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:12,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 764 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:49:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-22 19:49:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2021-11-22 19:49:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.1083743842364533) internal successors, (225), 207 states have internal predecessors, (225), 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-11-22 19:49:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2021-11-22 19:49:12,307 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 64 [2021-11-22 19:49:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:12,307 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2021-11-22 19:49:12,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-11-22 19:49:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2021-11-22 19:49:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 19:49:12,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:12,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:12,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:49:12,308 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-22 19:49:12,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:12,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384938484] [2021-11-22 19:49:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:12,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:12,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:12,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384938484] [2021-11-22 19:49:12,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384938484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:12,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:12,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:49:12,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525086038] [2021-11-22 19:49:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:12,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:49:12,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:49:12,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:49:12,462 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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-11-22 19:49:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:13,050 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2021-11-22 19:49:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:49:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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) Word has length 64 [2021-11-22 19:49:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:13,051 INFO L225 Difference]: With dead ends: 325 [2021-11-22 19:49:13,051 INFO L226 Difference]: Without dead ends: 317 [2021-11-22 19:49:13,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-22 19:49:13,052 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 327 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:13,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 531 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:49:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-22 19:49:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2021-11-22 19:49:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.1029411764705883) internal successors, (225), 208 states have internal predecessors, (225), 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-11-22 19:49:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 225 transitions. [2021-11-22 19:49:13,062 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 225 transitions. Word has length 64 [2021-11-22 19:49:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:13,062 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 225 transitions. [2021-11-22 19:49:13,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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-11-22 19:49:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2021-11-22 19:49:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 19:49:13,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:13,063 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:13,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:49:13,064 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:13,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-22 19:49:13,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:13,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402023394] [2021-11-22 19:49:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:13,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:49:13,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:13,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402023394] [2021-11-22 19:49:13,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402023394] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:49:13,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315275066] [2021-11-22 19:49:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:13,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:49:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:49:13,768 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-11-22 19:49:13,769 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-11-22 19:49:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:14,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-22 19:49:14,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:49:14,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:49:14,294 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 19:49:14,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 19:49:14,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-22 19:49:14,523 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:49:14,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-11-22 19:49:14,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-22 19:49:14,587 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:49:14,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2021-11-22 19:49:14,797 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-11-22 19:49:14,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 46 [2021-11-22 19:49:14,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2021-11-22 19:49:14,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-11-22 19:49:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:14,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:49:16,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| v_ArrVal_560)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse0 .cse1 (select .cse0 .cse1)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))) is different from false [2021-11-22 19:49:18,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))) is different from false [2021-11-22 19:49:20,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0))) is different from false [2021-11-22 19:49:20,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_558 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_558))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0))) is different from false [2021-11-22 19:49:20,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:20,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 54 [2021-11-22 19:49:20,949 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:20,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 217 [2021-11-22 19:49:20,961 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:20,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 311 treesize of output 297 [2021-11-22 19:49:21,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:49:21,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:21,204 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:21,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 77 treesize of output 73 [2021-11-22 19:49:21,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:49:21,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:21,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:21,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:21,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-11-22 19:49:21,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:49:21,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:21,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:21,311 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:21,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 [2021-11-22 19:49:21,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:21,391 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-22 19:49:21,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 57 [2021-11-22 19:49:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-22 19:49:22,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315275066] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:49:22,087 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:49:22,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 37 [2021-11-22 19:49:22,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454481382] [2021-11-22 19:49:22,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:49:22,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-22 19:49:22,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-22 19:49:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=939, Unknown=7, NotChecked=260, Total=1332 [2021-11-22 19:49:22,089 INFO L87 Difference]: Start difference. First operand 209 states and 225 transitions. Second operand has 37 states, 37 states have (on average 4.594594594594595) internal successors, (170), 37 states have internal predecessors, (170), 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-11-22 19:49:22,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) 8)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (forall ((v_ArrVal_558 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_558))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0))) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 1) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= .cse2 0)) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8) 0) (= |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (= |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (not (= .cse3 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)))) is different from false [2021-11-22 19:49:22,333 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (forall ((v_ArrVal_558 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_558))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8) 0) (not (= .cse2 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= .cse2 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)))) is different from false [2021-11-22 19:49:24,007 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8) 0) (not (= .cse1 0)) (not (= .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)))) is different from false [2021-11-22 19:49:26,011 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) 0) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse1 8 (select .cse1 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 19:49:27,932 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8)) (.cse0 (+ |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8))) (and (or (not |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short689#1|) (and (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse0) 0)))) (not (= .cse1 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse0) 0) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse2 8 (select .cse2 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 19:49:29,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (or (not |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short693#1|) (and (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse1) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse1) 0) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse2 8 (select .cse2 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 19:49:31,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse1) 0) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse2 8 (select .cse2 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 19:49:33,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_560))) (store .cse1 8 (select .cse1 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 19:49:35,338 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_560 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| v_ArrVal_560)) (.cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse1 .cse2 (select .cse1 .cse2)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)))) is different from false [2021-11-22 19:49:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:35,867 INFO L93 Difference]: Finished difference Result 345 states and 367 transitions. [2021-11-22 19:49:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 19:49:35,867 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.594594594594595) internal successors, (170), 37 states have internal predecessors, (170), 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) Word has length 65 [2021-11-22 19:49:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:35,868 INFO L225 Difference]: With dead ends: 345 [2021-11-22 19:49:35,868 INFO L226 Difference]: Without dead ends: 271 [2021-11-22 19:49:35,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=337, Invalid=1955, Unknown=16, NotChecked=1352, Total=3660 [2021-11-22 19:49:35,869 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 399 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:35,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 2551 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1024 Invalid, 0 Unknown, 864 Unchecked, 0.5s Time] [2021-11-22 19:49:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-22 19:49:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 202. [2021-11-22 19:49:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.095959595959596) internal successors, (217), 201 states have internal predecessors, (217), 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-11-22 19:49:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2021-11-22 19:49:35,882 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 65 [2021-11-22 19:49:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:35,883 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2021-11-22 19:49:35,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.594594594594595) internal successors, (170), 37 states have internal predecessors, (170), 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-11-22 19:49:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2021-11-22 19:49:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:49:35,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:35,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:35,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 19:49:36,109 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,SelfDestructingSolverStorable23 [2021-11-22 19:49:36,109 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-22 19:49:36,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:36,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731021006] [2021-11-22 19:49:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:36,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:36,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:36,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731021006] [2021-11-22 19:49:36,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731021006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:36,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:36,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:49:36,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084567587] [2021-11-22 19:49:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:36,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:49:36,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:49:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:49:36,313 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-11-22 19:49:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:36,646 INFO L93 Difference]: Finished difference Result 337 states and 361 transitions. [2021-11-22 19:49:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:49:36,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) Word has length 69 [2021-11-22 19:49:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:36,647 INFO L225 Difference]: With dead ends: 337 [2021-11-22 19:49:36,647 INFO L226 Difference]: Without dead ends: 273 [2021-11-22 19:49:36,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:49:36,648 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 184 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:36,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 574 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:49:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-22 19:49:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 202. [2021-11-22 19:49:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.0909090909090908) internal successors, (216), 201 states have internal predecessors, (216), 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-11-22 19:49:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2021-11-22 19:49:36,659 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 69 [2021-11-22 19:49:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:36,659 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2021-11-22 19:49:36,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-11-22 19:49:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2021-11-22 19:49:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 19:49:36,660 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:36,660 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:36,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:49:36,660 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1058361341, now seen corresponding path program 1 times [2021-11-22 19:49:36,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492990211] [2021-11-22 19:49:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:36,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:49:36,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:36,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492990211] [2021-11-22 19:49:36,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492990211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:36,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:36,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:49:36,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126199584] [2021-11-22 19:49:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:36,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:49:36,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:36,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:49:36,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:49:36,797 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-22 19:49:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:36,924 INFO L93 Difference]: Finished difference Result 288 states and 308 transitions. [2021-11-22 19:49:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:49:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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) Word has length 72 [2021-11-22 19:49:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:36,925 INFO L225 Difference]: With dead ends: 288 [2021-11-22 19:49:36,925 INFO L226 Difference]: Without dead ends: 224 [2021-11-22 19:49:36,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-22 19:49:36,925 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 32 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:36,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 462 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-22 19:49:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-11-22 19:49:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.088785046728972) internal successors, (233), 217 states have internal predecessors, (233), 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-11-22 19:49:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2021-11-22 19:49:36,935 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 72 [2021-11-22 19:49:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:36,935 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2021-11-22 19:49:36,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-22 19:49:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2021-11-22 19:49:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 19:49:36,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:36,936 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:36,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:49:36,936 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1034320377, now seen corresponding path program 1 times [2021-11-22 19:49:36,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:36,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195918704] [2021-11-22 19:49:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:36,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:37,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:37,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195918704] [2021-11-22 19:49:37,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195918704] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:49:37,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60052652] [2021-11-22 19:49:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:37,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:49:37,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:49:37,291 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-11-22 19:49:37,292 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-11-22 19:49:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:37,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 2690 conjuncts, 93 conjunts are in the unsatisfiable core [2021-11-22 19:49:37,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:49:37,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-22 19:49:37,899 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 19:49:37,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2021-11-22 19:49:37,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:49:37,944 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 19:49:37,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2021-11-22 19:49:38,172 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 19:49:38,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2021-11-22 19:49:38,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-22 19:49:38,208 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-22 19:49:38,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 49 [2021-11-22 19:49:38,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:38,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:38,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-11-22 19:49:38,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:38,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2021-11-22 19:49:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:38,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:49:39,476 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:39,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 73 [2021-11-22 19:49:39,485 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:39,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 81 treesize of output 85 [2021-11-22 19:49:39,713 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (forall ((v_ArrVal_751 Int) (v_ArrVal_747 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_747) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|))) (or (not (= (select (store .cse0 0 v_ArrVal_751) 8) 0)) (not (= (select .cse0 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) (select .cse0 8))))))) is different from false [2021-11-22 19:49:39,726 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (forall ((v_ArrVal_751 Int) (v_ArrVal_747 (Array Int Int)) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_747) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|))) (or (not (= (select (store .cse0 0 v_ArrVal_751) 8) 0)) (not (= (select .cse0 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) (select .cse0 8))))))) is different from false [2021-11-22 19:49:39,826 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:39,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 45 [2021-11-22 19:49:39,830 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:39,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2021-11-22 19:49:39,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:39,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2021-11-22 19:49:39,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:49:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:39,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60052652] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:49:39,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:49:39,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 19] total 46 [2021-11-22 19:49:39,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461442430] [2021-11-22 19:49:39,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:49:39,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-22 19:49:39,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-22 19:49:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1724, Unknown=20, NotChecked=170, Total=2070 [2021-11-22 19:49:39,864 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand has 46 states, 46 states have (on average 4.391304347826087) internal successors, (202), 46 states have internal predecessors, (202), 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-11-22 19:49:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:42,802 INFO L93 Difference]: Finished difference Result 336 states and 357 transitions. [2021-11-22 19:49:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-22 19:49:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.391304347826087) internal successors, (202), 46 states have internal predecessors, (202), 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) Word has length 74 [2021-11-22 19:49:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:42,811 INFO L225 Difference]: With dead ends: 336 [2021-11-22 19:49:42,811 INFO L226 Difference]: Without dead ends: 258 [2021-11-22 19:49:42,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1052, Invalid=5256, Unknown=20, NotChecked=314, Total=6642 [2021-11-22 19:49:42,813 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 1141 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:42,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 1661 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1311 Invalid, 0 Unknown, 619 Unchecked, 0.7s Time] [2021-11-22 19:49:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-22 19:49:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2021-11-22 19:49:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.0794392523364487) internal successors, (231), 217 states have internal predecessors, (231), 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-11-22 19:49:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2021-11-22 19:49:42,825 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 74 [2021-11-22 19:49:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:42,825 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2021-11-22 19:49:42,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.391304347826087) internal successors, (202), 46 states have internal predecessors, (202), 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-11-22 19:49:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2021-11-22 19:49:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 19:49:42,826 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:42,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:42,847 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-11-22 19:49:43,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-22 19:49:43,045 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash 144726291, now seen corresponding path program 1 times [2021-11-22 19:49:43,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:43,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085158167] [2021-11-22 19:49:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:43,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:43,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085158167] [2021-11-22 19:49:43,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085158167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:43,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:43,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:49:43,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130750893] [2021-11-22 19:49:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:43,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:49:43,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:49:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:49:43,481 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 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-11-22 19:49:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:44,235 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2021-11-22 19:49:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:49:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 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) Word has length 75 [2021-11-22 19:49:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:44,243 INFO L225 Difference]: With dead ends: 271 [2021-11-22 19:49:44,243 INFO L226 Difference]: Without dead ends: 205 [2021-11-22 19:49:44,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2021-11-22 19:49:44,244 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 850 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:44,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [850 Valid, 501 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-22 19:49:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2021-11-22 19:49:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.049689440993789) internal successors, (169), 162 states have internal predecessors, (169), 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-11-22 19:49:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 169 transitions. [2021-11-22 19:49:44,262 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 169 transitions. Word has length 75 [2021-11-22 19:49:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:44,264 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 169 transitions. [2021-11-22 19:49:44,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 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-11-22 19:49:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 169 transitions. [2021-11-22 19:49:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:49:44,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:44,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:44,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:49:44,273 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1442971818, now seen corresponding path program 1 times [2021-11-22 19:49:44,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:44,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218740083] [2021-11-22 19:49:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:44,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:44,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:44,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218740083] [2021-11-22 19:49:44,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218740083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:44,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:44,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:49:44,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789011493] [2021-11-22 19:49:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:44,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:49:44,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:49:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:49:44,519 INFO L87 Difference]: Start difference. First operand 163 states and 169 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-11-22 19:49:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:44,688 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2021-11-22 19:49:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:49:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) Word has length 76 [2021-11-22 19:49:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:44,689 INFO L225 Difference]: With dead ends: 223 [2021-11-22 19:49:44,689 INFO L226 Difference]: Without dead ends: 210 [2021-11-22 19:49:44,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:49:44,694 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 239 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:44,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 432 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-22 19:49:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 178. [2021-11-22 19:49:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 176 states have (on average 1.0454545454545454) internal successors, (184), 177 states have internal predecessors, (184), 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-11-22 19:49:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 184 transitions. [2021-11-22 19:49:44,703 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 184 transitions. Word has length 76 [2021-11-22 19:49:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:44,703 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 184 transitions. [2021-11-22 19:49:44,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-11-22 19:49:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 184 transitions. [2021-11-22 19:49:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:49:44,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:44,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:44,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:49:44,705 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1271940535, now seen corresponding path program 1 times [2021-11-22 19:49:44,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:44,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041936399] [2021-11-22 19:49:44,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:44,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:44,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:44,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041936399] [2021-11-22 19:49:44,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041936399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:44,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:44,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:49:44,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719453302] [2021-11-22 19:49:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:44,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:49:44,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:49:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:49:44,855 INFO L87 Difference]: Start difference. First operand 178 states and 184 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-11-22 19:49:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:45,109 INFO L93 Difference]: Finished difference Result 240 states and 247 transitions. [2021-11-22 19:49:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:49:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) Word has length 76 [2021-11-22 19:49:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:45,111 INFO L225 Difference]: With dead ends: 240 [2021-11-22 19:49:45,111 INFO L226 Difference]: Without dead ends: 174 [2021-11-22 19:49:45,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:49:45,112 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:45,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 547 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-22 19:49:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2021-11-22 19:49:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.051948051948052) internal successors, (162), 155 states have internal predecessors, (162), 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-11-22 19:49:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2021-11-22 19:49:45,120 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 76 [2021-11-22 19:49:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:45,120 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2021-11-22 19:49:45,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-11-22 19:49:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2021-11-22 19:49:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:49:45,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:45,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 19:49:45,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:49:45,122 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2124225498, now seen corresponding path program 1 times [2021-11-22 19:49:45,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:45,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659633606] [2021-11-22 19:49:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:45,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:45,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:45,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659633606] [2021-11-22 19:49:45,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659633606] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:45,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:45,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:49:45,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105692160] [2021-11-22 19:49:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:45,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:49:45,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:49:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:45,335 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-11-22 19:49:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:45,630 INFO L93 Difference]: Finished difference Result 238 states and 248 transitions. [2021-11-22 19:49:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:49:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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) Word has length 90 [2021-11-22 19:49:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:45,631 INFO L225 Difference]: With dead ends: 238 [2021-11-22 19:49:45,631 INFO L226 Difference]: Without dead ends: 194 [2021-11-22 19:49:45,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:49:45,632 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 267 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:45,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 324 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:49:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-22 19:49:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 175. [2021-11-22 19:49:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 174 states have internal predecessors, (182), 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-11-22 19:49:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2021-11-22 19:49:45,641 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 90 [2021-11-22 19:49:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:45,642 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2021-11-22 19:49:45,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-11-22 19:49:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2021-11-22 19:49:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-22 19:49:45,642 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:45,643 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:45,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:49:45,643 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1518276033, now seen corresponding path program 1 times [2021-11-22 19:49:45,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:45,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351408957] [2021-11-22 19:49:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:45,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 19:49:45,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:45,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351408957] [2021-11-22 19:49:45,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351408957] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:49:45,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:49:45,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:49:45,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901036580] [2021-11-22 19:49:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:49:45,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:49:45,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:49:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:49:45,837 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-11-22 19:49:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:46,057 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2021-11-22 19:49:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:49:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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) Word has length 93 [2021-11-22 19:49:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:46,058 INFO L225 Difference]: With dead ends: 212 [2021-11-22 19:49:46,058 INFO L226 Difference]: Without dead ends: 175 [2021-11-22 19:49:46,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:49:46,059 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 308 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:46,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 210 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:49:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-22 19:49:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-22 19:49:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0404624277456647) internal successors, (180), 174 states have internal predecessors, (180), 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-11-22 19:49:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 180 transitions. [2021-11-22 19:49:46,067 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 180 transitions. Word has length 93 [2021-11-22 19:49:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:46,067 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 180 transitions. [2021-11-22 19:49:46,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-11-22 19:49:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 180 transitions. [2021-11-22 19:49:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:49:46,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:46,068 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:46,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:49:46,068 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:49:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash -616554032, now seen corresponding path program 1 times [2021-11-22 19:49:46,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:46,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690709723] [2021-11-22 19:49:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:46,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:50,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:50,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690709723] [2021-11-22 19:49:50,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690709723] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:49:50,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751384461] [2021-11-22 19:49:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:50,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:49:50,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:49:50,795 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-11-22 19:49:50,796 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-11-22 19:49:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:52,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 2796 conjuncts, 238 conjunts are in the unsatisfiable core [2021-11-22 19:49:52,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:49:52,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:49:52,410 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 19:49:52,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 19:49:52,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:52,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-22 19:49:52,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-22 19:49:52,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 19:49:53,086 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-11-22 19:49:53,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-11-22 19:49:53,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-11-22 19:49:53,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-11-22 19:49:53,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2021-11-22 19:49:53,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:53,625 INFO L354 Elim1Store]: treesize reduction 180, result has 13.0 percent of original size [2021-11-22 19:49:53,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 175 treesize of output 169 [2021-11-22 19:49:53,638 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:49:53,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 172 [2021-11-22 19:49:53,649 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:49:53,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 160 [2021-11-22 19:49:53,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:53,811 INFO L354 Elim1Store]: treesize reduction 60, result has 26.8 percent of original size [2021-11-22 19:49:53,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2021-11-22 19:49:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:54,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:54,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:54,796 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:49:54,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2021-11-22 19:49:55,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:55,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:55,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:55,187 INFO L354 Elim1Store]: treesize reduction 226, result has 13.1 percent of original size [2021-11-22 19:49:55,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 173 treesize of output 172 [2021-11-22 19:49:55,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2021-11-22 19:49:55,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 141 [2021-11-22 19:49:55,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2021-11-22 19:49:55,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 124 [2021-11-22 19:49:58,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2021-11-22 19:49:58,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 82 [2021-11-22 19:49:58,250 INFO L354 Elim1Store]: treesize reduction 120, result has 7.0 percent of original size [2021-11-22 19:49:58,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 101 [2021-11-22 19:49:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:58,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15