./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_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 2d2088ac57520281350e2a5a3a1c8295b6f3f6b1edc40c64fce86e2816b5a5aa --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:28:58,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:28:58,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:28:58,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:28:58,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:28:58,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:28:58,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:28:58,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:28:58,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:28:58,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:28:58,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:28:58,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:28:58,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:28:58,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:28:58,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:28:58,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:28:58,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:28:58,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:28:58,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:28:58,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:28:58,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:28:58,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:28:58,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:28:58,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:28:58,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:28:58,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:28:58,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:28:58,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:28:58,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:28:58,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:28:58,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:28:58,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:28:58,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:28:58,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:28:58,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:28:58,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:28:58,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:28:58,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:28:58,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:28:58,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:28:58,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:28:58,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 10:28:58,423 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:28:58,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:28:58,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:28:58,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:28:58,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:28:58,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:28:58,426 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:28:58,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:28:58,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:28:58,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:28:58,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:28:58,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:28:58,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:28:58,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:28:58,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:28:58,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:28:58,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:28:58,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:28:58,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:28:58,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:28:58,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:28:58,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:28:58,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:28:58,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:28:58,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:28:58,430 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:28:58,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:28:58,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:28:58,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:28:58,432 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 -> 2d2088ac57520281350e2a5a3a1c8295b6f3f6b1edc40c64fce86e2816b5a5aa [2021-11-06 10:28:58,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:28:58,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:28:58,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:28:58,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:28:58,639 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:28:58,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i [2021-11-06 10:28:58,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f2690b7/f97bee77595c47f3b11d99d206b9b41c/FLAGc1d5e8f89 [2021-11-06 10:28:59,424 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:28:59,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i [2021-11-06 10:28:59,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f2690b7/f97bee77595c47f3b11d99d206b9b41c/FLAGc1d5e8f89 [2021-11-06 10:28:59,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f2690b7/f97bee77595c47f3b11d99d206b9b41c [2021-11-06 10:28:59,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:28:59,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:28:59,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:28:59,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:28:59,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:28:59,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:59" (1/1) ... [2021-11-06 10:28:59,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1666ad2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:59, skipping insertion in model container [2021-11-06 10:28:59,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:59" (1/1) ... [2021-11-06 10:28:59,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:28:59,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:29:00,030 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i[4497,4510] [2021-11-06 10:29:00,037 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i[4557,4570] [2021-11-06 10:29:00,056 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:29:00,063 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:29:00,657 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,658 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,658 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,659 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,660 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,670 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,670 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,672 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,672 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:00,914 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:29:00,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:29:00,916 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:29:00,917 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:29:00,918 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:29:00,918 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:29:00,919 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:29:00,920 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:29:00,920 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:29:00,921 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:29:01,068 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:29:01,166 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,169 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:29:01,291 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:29:01,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i[4497,4510] [2021-11-06 10:29:01,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be32_harness.i[4557,4570] [2021-11-06 10:29:01,304 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:29:01,304 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:29:01,333 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,334 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,334 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,334 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,335 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,338 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,339 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,339 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,340 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,361 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:29:01,362 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:29:01,363 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:29:01,363 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:29:01,364 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:29:01,364 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:29:01,365 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:29:01,365 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:29:01,365 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:29:01,366 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:29:01,380 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:29:01,424 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,425 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:01,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:29:01,689 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:29:01,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01 WrapperNode [2021-11-06 10:29:01,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:29:01,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:29:01,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:29:01,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:29:01,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:29:01,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:29:01,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:29:01,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:29:01,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:01,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:02,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:29:02,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:29:02,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:29:02,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:29:02,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (1/1) ... [2021-11-06 10:29:02,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:29:02,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:29:02,048 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-06 10:29:02,074 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-06 10:29:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure htonl [2021-11-06 10:29:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:29:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:29:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:29:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:29:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:29:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:29:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:29:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:29:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:29:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:29:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:29:10,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:29:10,815 INFO L299 CfgBuilder]: Removed 89 assume(true) statements. [2021-11-06 10:29:10,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:10 BoogieIcfgContainer [2021-11-06 10:29:10,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:29:10,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:29:10,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:29:10,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:29:10,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:59" (1/3) ... [2021-11-06 10:29:10,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566184e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:10, skipping insertion in model container [2021-11-06 10:29:10,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:01" (2/3) ... [2021-11-06 10:29:10,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566184e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:10, skipping insertion in model container [2021-11-06 10:29:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:10" (3/3) ... [2021-11-06 10:29:10,827 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_write_be32_harness.i [2021-11-06 10:29:10,831 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:29:10,831 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 10:29:10,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:29:10,876 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-06 10:29:10,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 10:29:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 185 states have internal predecessors, (258), 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-06 10:29:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 10:29:10,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:10,896 INFO L513 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] [2021-11-06 10:29:10,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 733514216, now seen corresponding path program 1 times [2021-11-06 10:29:10,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:10,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669513937] [2021-11-06 10:29:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:10,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:11,506 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-06 10:29:11,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:11,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669513937] [2021-11-06 10:29:11,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669513937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:11,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:11,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:29:11,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121086322] [2021-11-06 10:29:11,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:29:11,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:29:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:29:11,524 INFO L87 Difference]: Start difference. First operand has 186 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 185 states have internal predecessors, (258), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-06 10:29:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:11,549 INFO L93 Difference]: Finished difference Result 368 states and 511 transitions. [2021-11-06 10:29:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:29:11,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2021-11-06 10:29:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:11,559 INFO L225 Difference]: With dead ends: 368 [2021-11-06 10:29:11,559 INFO L226 Difference]: Without dead ends: 181 [2021-11-06 10:29:11,561 INFO L786 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-06 10:29:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-06 10:29:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-06 10:29:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.3588235294117648) internal successors, (231), 180 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-06 10:29:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2021-11-06 10:29:11,596 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 39 [2021-11-06 10:29:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:11,597 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2021-11-06 10:29:11,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-06 10:29:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2021-11-06 10:29:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 10:29:11,599 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:11,599 INFO L513 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] [2021-11-06 10:29:11,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:29:11,600 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 699508844, now seen corresponding path program 1 times [2021-11-06 10:29:11,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:11,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696456817] [2021-11-06 10:29:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:11,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:11,883 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-06 10:29:11,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:11,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696456817] [2021-11-06 10:29:11,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696456817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:11,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:11,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:29:11,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094880645] [2021-11-06 10:29:11,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:29:11,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:29:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:29:11,886 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-06 10:29:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:12,125 INFO L93 Difference]: Finished difference Result 336 states and 428 transitions. [2021-11-06 10:29:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:29:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2021-11-06 10:29:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:12,127 INFO L225 Difference]: With dead ends: 336 [2021-11-06 10:29:12,128 INFO L226 Difference]: Without dead ends: 181 [2021-11-06 10:29:12,129 INFO L786 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-06 10:29:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-06 10:29:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-06 10:29:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 180 states have internal predecessors, (228), 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-06 10:29:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2021-11-06 10:29:12,139 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 39 [2021-11-06 10:29:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:12,139 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2021-11-06 10:29:12,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-06 10:29:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2021-11-06 10:29:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:29:12,141 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:12,141 INFO L513 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] [2021-11-06 10:29:12,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:29:12,141 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1277536330, now seen corresponding path program 1 times [2021-11-06 10:29:12,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:12,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366451933] [2021-11-06 10:29:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:12,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:12,430 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-06 10:29:12,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:12,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366451933] [2021-11-06 10:29:12,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366451933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:12,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:12,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:29:12,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729633367] [2021-11-06 10:29:12,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:29:12,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:12,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:29:12,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:29:12,433 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-06 10:29:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:12,860 INFO L93 Difference]: Finished difference Result 397 states and 508 transitions. [2021-11-06 10:29:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:29:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2021-11-06 10:29:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:12,863 INFO L225 Difference]: With dead ends: 397 [2021-11-06 10:29:12,863 INFO L226 Difference]: Without dead ends: 241 [2021-11-06 10:29:12,864 INFO L786 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-06 10:29:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-06 10:29:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 193. [2021-11-06 10:29:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 192 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-06 10:29:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 240 transitions. [2021-11-06 10:29:12,875 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 240 transitions. Word has length 51 [2021-11-06 10:29:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:12,875 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 240 transitions. [2021-11-06 10:29:12,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-06 10:29:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 240 transitions. [2021-11-06 10:29:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:29:12,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:12,877 INFO L513 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] [2021-11-06 10:29:12,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:29:12,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1671903116, now seen corresponding path program 1 times [2021-11-06 10:29:12,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:12,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37702905] [2021-11-06 10:29:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:12,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:13,220 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-06 10:29:13,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:13,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37702905] [2021-11-06 10:29:13,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37702905] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:13,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:13,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:29:13,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145016428] [2021-11-06 10:29:13,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:29:13,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:29:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:29:13,223 INFO L87 Difference]: Start difference. First operand 193 states and 240 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-06 10:29:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:13,460 INFO L93 Difference]: Finished difference Result 314 states and 387 transitions. [2021-11-06 10:29:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:29:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2021-11-06 10:29:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:13,462 INFO L225 Difference]: With dead ends: 314 [2021-11-06 10:29:13,462 INFO L226 Difference]: Without dead ends: 193 [2021-11-06 10:29:13,463 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:29:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-06 10:29:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-11-06 10:29:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 192 states have internal predecessors, (239), 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-06 10:29:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2021-11-06 10:29:13,471 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 51 [2021-11-06 10:29:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:13,471 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2021-11-06 10:29:13,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-06 10:29:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2021-11-06 10:29:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 10:29:13,473 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:13,473 INFO L513 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] [2021-11-06 10:29:13,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:29:13,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1284348023, now seen corresponding path program 1 times [2021-11-06 10:29:13,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:13,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696921460] [2021-11-06 10:29:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:13,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:13,814 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-06 10:29:13,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:13,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696921460] [2021-11-06 10:29:13,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696921460] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:13,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:13,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:29:13,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950715301] [2021-11-06 10:29:13,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:29:13,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:29:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:29:13,817 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-06 10:29:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:14,191 INFO L93 Difference]: Finished difference Result 265 states and 320 transitions. [2021-11-06 10:29:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:29:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 57 [2021-11-06 10:29:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:14,192 INFO L225 Difference]: With dead ends: 265 [2021-11-06 10:29:14,193 INFO L226 Difference]: Without dead ends: 193 [2021-11-06 10:29:14,193 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:29:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-06 10:29:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-11-06 10:29:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 182 states have (on average 1.3021978021978022) internal successors, (237), 192 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-06 10:29:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2021-11-06 10:29:14,199 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 57 [2021-11-06 10:29:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:14,200 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2021-11-06 10:29:14,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-06 10:29:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2021-11-06 10:29:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 10:29:14,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:14,201 INFO L513 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] [2021-11-06 10:29:14,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:29:14,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash 718341164, now seen corresponding path program 1 times [2021-11-06 10:29:14,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:14,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990481937] [2021-11-06 10:29:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:14,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:14,798 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-06 10:29:14,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:14,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990481937] [2021-11-06 10:29:14,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990481937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:14,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:14,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:29:14,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374990902] [2021-11-06 10:29:14,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:29:14,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:14,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:29:14,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:29:14,801 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-06 10:29:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:15,511 INFO L93 Difference]: Finished difference Result 310 states and 367 transitions. [2021-11-06 10:29:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:29:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2021-11-06 10:29:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:15,513 INFO L225 Difference]: With dead ends: 310 [2021-11-06 10:29:15,513 INFO L226 Difference]: Without dead ends: 297 [2021-11-06 10:29:15,514 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:29:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-06 10:29:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 199. [2021-11-06 10:29:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 198 states have internal predecessors, (242), 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-06 10:29:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2021-11-06 10:29:15,521 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 63 [2021-11-06 10:29:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:15,521 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2021-11-06 10:29:15,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-06 10:29:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2021-11-06 10:29:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 10:29:15,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:15,523 INFO L513 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] [2021-11-06 10:29:15,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:29:15,524 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1235696670, now seen corresponding path program 1 times [2021-11-06 10:29:15,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:15,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803685701] [2021-11-06 10:29:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:15,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:16,156 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-06 10:29:16,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:16,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803685701] [2021-11-06 10:29:16,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803685701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:16,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:16,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:29:16,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192377206] [2021-11-06 10:29:16,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:29:16,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:29:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:29:16,158 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-06 10:29:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:21,506 INFO L93 Difference]: Finished difference Result 595 states and 724 transitions. [2021-11-06 10:29:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:29:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2021-11-06 10:29:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:21,509 INFO L225 Difference]: With dead ends: 595 [2021-11-06 10:29:21,509 INFO L226 Difference]: Without dead ends: 418 [2021-11-06 10:29:21,510 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:29:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-06 10:29:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2021-11-06 10:29:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 228 states have (on average 1.2850877192982457) internal successors, (293), 238 states have internal predecessors, (293), 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-06 10:29:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 293 transitions. [2021-11-06 10:29:21,517 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 293 transitions. Word has length 67 [2021-11-06 10:29:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:21,517 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 293 transitions. [2021-11-06 10:29:21,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-06 10:29:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2021-11-06 10:29:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 10:29:21,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:21,519 INFO L513 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] [2021-11-06 10:29:21,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:29:21,520 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -555638300, now seen corresponding path program 1 times [2021-11-06 10:29:21,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:21,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057458006] [2021-11-06 10:29:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:21,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:22,428 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-06 10:29:22,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:22,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057458006] [2021-11-06 10:29:22,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057458006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:22,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:22,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:29:22,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741978714] [2021-11-06 10:29:22,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:29:22,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:29:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:29:22,431 INFO L87 Difference]: Start difference. First operand 239 states and 293 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-06 10:29:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:27,997 INFO L93 Difference]: Finished difference Result 505 states and 610 transitions. [2021-11-06 10:29:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:29:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 67 [2021-11-06 10:29:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:27,999 INFO L225 Difference]: With dead ends: 505 [2021-11-06 10:29:27,999 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 10:29:28,000 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:29:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 10:29:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 254. [2021-11-06 10:29:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.2798353909465021) internal successors, (311), 253 states have internal predecessors, (311), 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-06 10:29:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2021-11-06 10:29:28,008 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 67 [2021-11-06 10:29:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:28,008 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2021-11-06 10:29:28,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-06 10:29:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2021-11-06 10:29:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 10:29:28,009 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:28,009 INFO L513 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] [2021-11-06 10:29:28,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:29:28,010 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2143986202, now seen corresponding path program 1 times [2021-11-06 10:29:28,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:28,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496351110] [2021-11-06 10:29:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:28,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:29,064 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-06 10:29:29,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:29,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496351110] [2021-11-06 10:29:29,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496351110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:29,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:29,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:29:29,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475632078] [2021-11-06 10:29:29,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:29:29,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:29,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:29:29,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:29:29,067 INFO L87 Difference]: Start difference. First operand 254 states and 311 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-06 10:29:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:39,874 INFO L93 Difference]: Finished difference Result 455 states and 547 transitions. [2021-11-06 10:29:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:29:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67 [2021-11-06 10:29:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:39,876 INFO L225 Difference]: With dead ends: 455 [2021-11-06 10:29:39,877 INFO L226 Difference]: Without dead ends: 377 [2021-11-06 10:29:39,877 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:29:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-06 10:29:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 259. [2021-11-06 10:29:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 248 states have (on average 1.282258064516129) internal successors, (318), 258 states have internal predecessors, (318), 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-06 10:29:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2021-11-06 10:29:39,885 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 67 [2021-11-06 10:29:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:39,886 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2021-11-06 10:29:39,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-06 10:29:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2021-11-06 10:29:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 10:29:39,887 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:39,887 INFO L513 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] [2021-11-06 10:29:39,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:29:39,887 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1892815656, now seen corresponding path program 1 times [2021-11-06 10:29:39,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:39,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190582072] [2021-11-06 10:29:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:39,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:42,715 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-06 10:29:42,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:42,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190582072] [2021-11-06 10:29:42,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190582072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:42,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:42,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:29:42,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858013491] [2021-11-06 10:29:42,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:29:42,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:42,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:29:42,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:29:42,718 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-06 10:29:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:46,098 INFO L93 Difference]: Finished difference Result 552 states and 681 transitions. [2021-11-06 10:29:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:29:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2021-11-06 10:29:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:46,100 INFO L225 Difference]: With dead ends: 552 [2021-11-06 10:29:46,100 INFO L226 Difference]: Without dead ends: 327 [2021-11-06 10:29:46,100 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:29:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-06 10:29:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 262. [2021-11-06 10:29:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 251 states have (on average 1.2828685258964143) internal successors, (322), 261 states have internal predecessors, (322), 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-06 10:29:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 322 transitions. [2021-11-06 10:29:46,112 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 322 transitions. Word has length 67 [2021-11-06 10:29:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:46,112 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 322 transitions. [2021-11-06 10:29:46,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-06 10:29:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 322 transitions. [2021-11-06 10:29:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 10:29:46,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:46,114 INFO L513 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] [2021-11-06 10:29:46,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:29:46,114 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:29:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2013763211, now seen corresponding path program 1 times [2021-11-06 10:29:46,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:46,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827738433] [2021-11-06 10:29:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:46,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:48,192 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-06 10:29:48,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:48,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827738433] [2021-11-06 10:29:48,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827738433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:48,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:48,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:29:48,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693663582] [2021-11-06 10:29:48,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:29:48,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:29:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:29:48,196 INFO L87 Difference]: Start difference. First operand 262 states and 322 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 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-06 10:30:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:16,542 INFO L93 Difference]: Finished difference Result 928 states and 1133 transitions. [2021-11-06 10:30:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-06 10:30:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 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-06 10:30:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:16,545 INFO L225 Difference]: With dead ends: 928 [2021-11-06 10:30:16,546 INFO L226 Difference]: Without dead ends: 686 [2021-11-06 10:30:16,548 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=503, Invalid=2359, Unknown=0, NotChecked=0, Total=2862 [2021-11-06 10:30:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-11-06 10:30:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 341. [2021-11-06 10:30:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 330 states have (on average 1.2363636363636363) internal successors, (408), 340 states have internal predecessors, (408), 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-06 10:30:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 408 transitions. [2021-11-06 10:30:16,562 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 408 transitions. Word has length 74 [2021-11-06 10:30:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:16,562 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 408 transitions. [2021-11-06 10:30:16,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 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-06 10:30:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 408 transitions. [2021-11-06 10:30:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 10:30:16,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:16,564 INFO L513 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] [2021-11-06 10:30:16,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:30:16,564 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:30:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1453063433, now seen corresponding path program 1 times [2021-11-06 10:30:16,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:16,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196891488] [2021-11-06 10:30:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:16,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:17,467 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-06 10:30:17,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:17,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196891488] [2021-11-06 10:30:17,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196891488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:17,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:17,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:30:17,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548055966] [2021-11-06 10:30:17,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:30:17,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:30:17,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:30:17,469 INFO L87 Difference]: Start difference. First operand 341 states and 408 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-06 10:30:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:21,115 INFO L93 Difference]: Finished difference Result 823 states and 976 transitions. [2021-11-06 10:30:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:30:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-06 10:30:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:21,118 INFO L225 Difference]: With dead ends: 823 [2021-11-06 10:30:21,118 INFO L226 Difference]: Without dead ends: 613 [2021-11-06 10:30:21,118 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:30:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-11-06 10:30:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 352. [2021-11-06 10:30:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.2346041055718475) internal successors, (421), 351 states have internal predecessors, (421), 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-06 10:30:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 421 transitions. [2021-11-06 10:30:21,131 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 421 transitions. Word has length 74 [2021-11-06 10:30:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:21,131 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 421 transitions. [2021-11-06 10:30:21,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-06 10:30:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 421 transitions. [2021-11-06 10:30:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 10:30:21,133 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:21,133 INFO L513 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] [2021-11-06 10:30:21,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:30:21,133 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:30:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -360304177, now seen corresponding path program 1 times [2021-11-06 10:30:21,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:21,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545402083] [2021-11-06 10:30:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:21,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:23,187 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-06 10:30:23,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:23,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545402083] [2021-11-06 10:30:23,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545402083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:23,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:23,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-06 10:30:23,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194527134] [2021-11-06 10:30:23,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 10:30:23,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 10:30:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:30:23,192 INFO L87 Difference]: Start difference. First operand 352 states and 421 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 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-06 10:30:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:58,972 INFO L93 Difference]: Finished difference Result 1013 states and 1211 transitions. [2021-11-06 10:30:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-06 10:30:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 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-06 10:30:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:58,976 INFO L225 Difference]: With dead ends: 1013 [2021-11-06 10:30:58,976 INFO L226 Difference]: Without dead ends: 814 [2021-11-06 10:30:58,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=652, Invalid=2888, Unknown=0, NotChecked=0, Total=3540 [2021-11-06 10:30:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-11-06 10:30:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 354. [2021-11-06 10:30:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 343 states have (on average 1.2361516034985423) internal successors, (424), 353 states have internal predecessors, (424), 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-06 10:30:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 424 transitions. [2021-11-06 10:30:58,991 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 424 transitions. Word has length 74 [2021-11-06 10:30:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:58,991 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 424 transitions. [2021-11-06 10:30:58,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 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-06 10:30:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 424 transitions. [2021-11-06 10:30:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 10:30:58,993 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:58,993 INFO L513 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] [2021-11-06 10:30:58,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:30:58,993 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:30:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash -319629427, now seen corresponding path program 1 times [2021-11-06 10:30:58,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:58,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326143532] [2021-11-06 10:30:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:58,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:59,482 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-06 10:30:59,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:59,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326143532] [2021-11-06 10:30:59,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326143532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:59,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:59,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:30:59,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891104429] [2021-11-06 10:30:59,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:30:59,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:30:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:30:59,484 INFO L87 Difference]: Start difference. First operand 354 states and 424 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06 10:31:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:02,345 INFO L93 Difference]: Finished difference Result 783 states and 933 transitions. [2021-11-06 10:31:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:31:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06 10:31:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:02,347 INFO L225 Difference]: With dead ends: 783 [2021-11-06 10:31:02,347 INFO L226 Difference]: Without dead ends: 497 [2021-11-06 10:31:02,348 INFO L786 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-06 10:31:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-06 10:31:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 352. [2021-11-06 10:31:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.2111436950146628) internal successors, (413), 351 states have internal predecessors, (413), 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-06 10:31:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 413 transitions. [2021-11-06 10:31:02,360 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 413 transitions. Word has length 74 [2021-11-06 10:31:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:02,361 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 413 transitions. [2021-11-06 10:31:02,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06 10:31:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 413 transitions. [2021-11-06 10:31:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:31:02,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:02,362 INFO L513 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-06 10:31:02,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:31:02,362 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:31:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1815438626, now seen corresponding path program 1 times [2021-11-06 10:31:02,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:02,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408603216] [2021-11-06 10:31:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:02,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:02,956 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-06 10:31:02,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:02,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408603216] [2021-11-06 10:31:02,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408603216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:02,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:02,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:31:02,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140810071] [2021-11-06 10:31:02,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:31:02,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:31:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:31:02,958 INFO L87 Difference]: Start difference. First operand 352 states and 413 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-06 10:31:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:03,641 INFO L93 Difference]: Finished difference Result 740 states and 852 transitions. [2021-11-06 10:31:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:31:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-06 10:31:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:03,643 INFO L225 Difference]: With dead ends: 740 [2021-11-06 10:31:03,644 INFO L226 Difference]: Without dead ends: 415 [2021-11-06 10:31:03,644 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:31:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-11-06 10:31:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 352. [2021-11-06 10:31:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.18475073313783) internal successors, (404), 351 states have internal predecessors, (404), 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-06 10:31:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 404 transitions. [2021-11-06 10:31:03,658 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 404 transitions. Word has length 75 [2021-11-06 10:31:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:03,658 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 404 transitions. [2021-11-06 10:31:03,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-06 10:31:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 404 transitions. [2021-11-06 10:31:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:31:03,660 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:03,660 INFO L513 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-06 10:31:03,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:31:03,660 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:31:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1592329908, now seen corresponding path program 1 times [2021-11-06 10:31:03,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:03,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497811050] [2021-11-06 10:31:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:03,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:04,705 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-06 10:31:04,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:04,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497811050] [2021-11-06 10:31:04,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497811050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:04,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:04,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:31:04,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170860390] [2021-11-06 10:31:04,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:31:04,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:31:04,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:31:04,706 INFO L87 Difference]: Start difference. First operand 352 states and 404 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-06 10:31:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:17,782 INFO L93 Difference]: Finished difference Result 673 states and 773 transitions. [2021-11-06 10:31:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:31:17,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-06 10:31:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:17,784 INFO L225 Difference]: With dead ends: 673 [2021-11-06 10:31:17,784 INFO L226 Difference]: Without dead ends: 478 [2021-11-06 10:31:17,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:31:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-06 10:31:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 350. [2021-11-06 10:31:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 339 states have (on average 1.1799410029498525) internal successors, (400), 349 states have internal predecessors, (400), 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-06 10:31:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 400 transitions. [2021-11-06 10:31:17,796 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 400 transitions. Word has length 76 [2021-11-06 10:31:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:17,797 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 400 transitions. [2021-11-06 10:31:17,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-06 10:31:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 400 transitions. [2021-11-06 10:31:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 10:31:17,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:17,798 INFO L513 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] [2021-11-06 10:31:17,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:31:17,798 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:31:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1068292604, now seen corresponding path program 1 times [2021-11-06 10:31:17,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:17,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091914231] [2021-11-06 10:31:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:17,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:17,992 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-06 10:31:17,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:17,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091914231] [2021-11-06 10:31:17,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091914231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:17,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:17,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:31:17,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682202249] [2021-11-06 10:31:17,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:31:17,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:17,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:31:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:31:17,993 INFO L87 Difference]: Start difference. First operand 350 states and 400 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-06 10:31:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:18,290 INFO L93 Difference]: Finished difference Result 580 states and 662 transitions. [2021-11-06 10:31:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:31:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2021-11-06 10:31:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:18,295 INFO L225 Difference]: With dead ends: 580 [2021-11-06 10:31:18,295 INFO L226 Difference]: Without dead ends: 252 [2021-11-06 10:31:18,296 INFO L786 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-06 10:31:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-06 10:31:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 231. [2021-11-06 10:31:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 220 states have (on average 1.1772727272727272) internal successors, (259), 230 states have internal predecessors, (259), 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-06 10:31:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2021-11-06 10:31:18,305 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 259 transitions. Word has length 79 [2021-11-06 10:31:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:18,305 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 259 transitions. [2021-11-06 10:31:18,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-06 10:31:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 259 transitions. [2021-11-06 10:31:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 10:31:18,306 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:18,306 INFO L513 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] [2021-11-06 10:31:18,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:31:18,307 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:31:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1364907914, now seen corresponding path program 1 times [2021-11-06 10:31:18,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:18,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233725458] [2021-11-06 10:31:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:18,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:19,599 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-06 10:31:19,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:19,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233725458] [2021-11-06 10:31:19,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233725458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:19,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:19,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:31:19,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752840014] [2021-11-06 10:31:19,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:31:19,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:19,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:31:19,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:31:19,601 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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-06 10:31:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:32,852 INFO L93 Difference]: Finished difference Result 500 states and 555 transitions. [2021-11-06 10:31:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:31:32,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 79 [2021-11-06 10:31:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:32,854 INFO L225 Difference]: With dead ends: 500 [2021-11-06 10:31:32,854 INFO L226 Difference]: Without dead ends: 300 [2021-11-06 10:31:32,854 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:31:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-06 10:31:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 250. [2021-11-06 10:31:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.1631799163179917) internal successors, (278), 249 states have internal predecessors, (278), 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-06 10:31:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 278 transitions. [2021-11-06 10:31:32,863 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 278 transitions. Word has length 79 [2021-11-06 10:31:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:32,864 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 278 transitions. [2021-11-06 10:31:32,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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-06 10:31:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 278 transitions. [2021-11-06 10:31:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 10:31:32,865 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:32,865 INFO L513 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] [2021-11-06 10:31:32,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:31:32,865 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:31:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1084692216, now seen corresponding path program 1 times [2021-11-06 10:31:32,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:32,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695820612] [2021-11-06 10:31:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:32,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:36,668 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-06 10:31:36,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:36,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695820612] [2021-11-06 10:31:36,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695820612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:36,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:36,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:31:36,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910279319] [2021-11-06 10:31:36,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:31:36,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:31:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:31:36,670 INFO L87 Difference]: Start difference. First operand 250 states and 278 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-06 10:31:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:43,819 INFO L93 Difference]: Finished difference Result 510 states and 567 transitions. [2021-11-06 10:31:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:31:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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 79 [2021-11-06 10:31:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:43,821 INFO L225 Difference]: With dead ends: 510 [2021-11-06 10:31:43,821 INFO L226 Difference]: Without dead ends: 359 [2021-11-06 10:31:43,822 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:31:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-11-06 10:31:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 271. [2021-11-06 10:31:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 260 states have (on average 1.1538461538461537) internal successors, (300), 270 states have internal predecessors, (300), 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-06 10:31:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 300 transitions. [2021-11-06 10:31:43,833 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 300 transitions. Word has length 79 [2021-11-06 10:31:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:43,833 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 300 transitions. [2021-11-06 10:31:43,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-06 10:31:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 300 transitions. [2021-11-06 10:31:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-06 10:31:43,834 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:43,834 INFO L513 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] [2021-11-06 10:31:43,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:31:43,835 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:31:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash -832956375, now seen corresponding path program 1 times [2021-11-06 10:31:43,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:43,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405950573] [2021-11-06 10:31:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:43,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:45,617 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-06 10:31:45,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:45,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405950573] [2021-11-06 10:31:45,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405950573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:45,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:45,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:31:45,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50325894] [2021-11-06 10:31:45,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:31:45,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:45,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:31:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:31:45,619 INFO L87 Difference]: Start difference. First operand 271 states and 300 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-06 10:32:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:01,746 INFO L93 Difference]: Finished difference Result 500 states and 557 transitions. [2021-11-06 10:32:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:32:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 82 [2021-11-06 10:32:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:01,748 INFO L225 Difference]: With dead ends: 500 [2021-11-06 10:32:01,748 INFO L226 Difference]: Without dead ends: 349 [2021-11-06 10:32:01,748 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:32:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-06 10:32:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 277. [2021-11-06 10:32:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 266 states have (on average 1.1541353383458646) internal successors, (307), 276 states have internal predecessors, (307), 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-06 10:32:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 307 transitions. [2021-11-06 10:32:01,760 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 307 transitions. Word has length 82 [2021-11-06 10:32:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:01,760 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 307 transitions. [2021-11-06 10:32:01,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-06 10:32:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 307 transitions. [2021-11-06 10:32:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:32:01,761 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:01,761 INFO L513 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] [2021-11-06 10:32:01,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:32:01,762 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:32:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash 121635765, now seen corresponding path program 1 times [2021-11-06 10:32:01,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:01,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006331220] [2021-11-06 10:32:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:01,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:02,584 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-06 10:32:02,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:02,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006331220] [2021-11-06 10:32:02,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006331220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:02,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:02,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:32:02,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785294456] [2021-11-06 10:32:02,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:32:02,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:32:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:32:02,586 INFO L87 Difference]: Start difference. First operand 277 states and 307 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-06 10:32:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:07,914 INFO L93 Difference]: Finished difference Result 571 states and 640 transitions. [2021-11-06 10:32:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:32:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2021-11-06 10:32:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:07,916 INFO L225 Difference]: With dead ends: 571 [2021-11-06 10:32:07,916 INFO L226 Difference]: Without dead ends: 425 [2021-11-06 10:32:07,917 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:32:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-11-06 10:32:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 297. [2021-11-06 10:32:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.1433566433566433) internal successors, (327), 296 states have internal predecessors, (327), 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-06 10:32:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 327 transitions. [2021-11-06 10:32:07,927 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 327 transitions. Word has length 85 [2021-11-06 10:32:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:07,928 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 327 transitions. [2021-11-06 10:32:07,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-06 10:32:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 327 transitions. [2021-11-06 10:32:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:32:07,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:07,929 INFO L513 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] [2021-11-06 10:32:07,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:32:07,929 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:32:07,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1466712137, now seen corresponding path program 1 times [2021-11-06 10:32:07,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:07,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468133228] [2021-11-06 10:32:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:07,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:09,292 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-06 10:32:09,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:09,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468133228] [2021-11-06 10:32:09,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468133228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:09,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:09,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:32:09,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929940540] [2021-11-06 10:32:09,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:32:09,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:09,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:32:09,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:32:09,294 INFO L87 Difference]: Start difference. First operand 297 states and 327 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 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-06 10:32:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:20,453 INFO L93 Difference]: Finished difference Result 550 states and 606 transitions. [2021-11-06 10:32:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:32:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 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 85 [2021-11-06 10:32:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:20,455 INFO L225 Difference]: With dead ends: 550 [2021-11-06 10:32:20,455 INFO L226 Difference]: Without dead ends: 472 [2021-11-06 10:32:20,455 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2021-11-06 10:32:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-06 10:32:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 340. [2021-11-06 10:32:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 329 states have (on average 1.1367781155015197) internal successors, (374), 339 states have internal predecessors, (374), 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-06 10:32:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 374 transitions. [2021-11-06 10:32:20,468 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 374 transitions. Word has length 85 [2021-11-06 10:32:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:20,469 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 374 transitions. [2021-11-06 10:32:20,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 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-06 10:32:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 374 transitions. [2021-11-06 10:32:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:32:20,470 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:20,470 INFO L513 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] [2021-11-06 10:32:20,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:32:20,470 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:32:20,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1724877575, now seen corresponding path program 1 times [2021-11-06 10:32:20,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:20,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036839787] [2021-11-06 10:32:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:20,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:25,536 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-06 10:32:25,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:25,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036839787] [2021-11-06 10:32:25,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036839787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:25,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:25,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:32:25,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655994147] [2021-11-06 10:32:25,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:32:25,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:25,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:32:25,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:32:25,538 INFO L87 Difference]: Start difference. First operand 340 states and 374 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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-06 10:32:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:31,506 INFO L93 Difference]: Finished difference Result 497 states and 546 transitions. [2021-11-06 10:32:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:32:31,507 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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 85 [2021-11-06 10:32:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:31,508 INFO L225 Difference]: With dead ends: 497 [2021-11-06 10:32:31,508 INFO L226 Difference]: Without dead ends: 386 [2021-11-06 10:32:31,509 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:32:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-06 10:32:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 268. [2021-11-06 10:32:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 257 states have (on average 1.1828793774319066) internal successors, (304), 267 states have internal predecessors, (304), 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-06 10:32:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 304 transitions. [2021-11-06 10:32:31,521 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 304 transitions. Word has length 85 [2021-11-06 10:32:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:31,522 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 304 transitions. [2021-11-06 10:32:31,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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-06 10:32:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 304 transitions. [2021-11-06 10:32:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:32:31,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:31,523 INFO L513 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] [2021-11-06 10:32:31,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:32:31,523 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:32:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1137079539, now seen corresponding path program 1 times [2021-11-06 10:32:31,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:31,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828359483] [2021-11-06 10:32:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:31,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:32,237 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-06 10:32:32,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:32,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828359483] [2021-11-06 10:32:32,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828359483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:32,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:32,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:32:32,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884150872] [2021-11-06 10:32:32,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:32:32,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:32,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:32:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:32:32,239 INFO L87 Difference]: Start difference. First operand 268 states and 304 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-06 10:32:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:38,055 INFO L93 Difference]: Finished difference Result 436 states and 487 transitions. [2021-11-06 10:32:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:32:38,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 85 [2021-11-06 10:32:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:38,057 INFO L225 Difference]: With dead ends: 436 [2021-11-06 10:32:38,057 INFO L226 Difference]: Without dead ends: 370 [2021-11-06 10:32:38,057 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:32:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-11-06 10:32:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 278. [2021-11-06 10:32:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 267 states have (on average 1.1797752808988764) internal successors, (315), 277 states have internal predecessors, (315), 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-06 10:32:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 315 transitions. [2021-11-06 10:32:38,070 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 315 transitions. Word has length 85 [2021-11-06 10:32:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:38,071 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 315 transitions. [2021-11-06 10:32:38,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-06 10:32:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 315 transitions. [2021-11-06 10:32:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:32:38,072 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:38,072 INFO L513 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] [2021-11-06 10:32:38,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:32:38,072 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:32:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 353688179, now seen corresponding path program 1 times [2021-11-06 10:32:38,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:38,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497270135] [2021-11-06 10:32:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:38,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:39,588 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-06 10:32:39,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:39,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497270135] [2021-11-06 10:32:39,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497270135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:39,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:39,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:32:39,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74079511] [2021-11-06 10:32:39,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:32:39,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:39,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:32:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:32:39,590 INFO L87 Difference]: Start difference. First operand 278 states and 315 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-06 10:32:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:56,241 INFO L93 Difference]: Finished difference Result 588 states and 667 transitions. [2021-11-06 10:32:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:32:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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 85 [2021-11-06 10:32:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:56,243 INFO L225 Difference]: With dead ends: 588 [2021-11-06 10:32:56,243 INFO L226 Difference]: Without dead ends: 422 [2021-11-06 10:32:56,244 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:32:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-11-06 10:32:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 306. [2021-11-06 10:32:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 295 states have (on average 1.1661016949152543) internal successors, (344), 305 states have internal predecessors, (344), 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-06 10:32:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 344 transitions. [2021-11-06 10:32:56,258 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 344 transitions. Word has length 85 [2021-11-06 10:32:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:56,258 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 344 transitions. [2021-11-06 10:32:56,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-06 10:32:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 344 transitions. [2021-11-06 10:32:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:32:56,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:56,259 INFO L513 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] [2021-11-06 10:32:56,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:32:56,260 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:32:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1234659723, now seen corresponding path program 1 times [2021-11-06 10:32:56,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:56,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979606730] [2021-11-06 10:32:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:56,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:57,889 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-06 10:32:57,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:57,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979606730] [2021-11-06 10:32:57,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979606730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:57,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:57,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:32:57,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571531697] [2021-11-06 10:32:57,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:32:57,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:32:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:32:57,892 INFO L87 Difference]: Start difference. First operand 306 states and 344 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 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-06 10:33:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:19,559 INFO L93 Difference]: Finished difference Result 560 states and 635 transitions. [2021-11-06 10:33:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:33:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 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 85 [2021-11-06 10:33:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:19,560 INFO L225 Difference]: With dead ends: 560 [2021-11-06 10:33:19,560 INFO L226 Difference]: Without dead ends: 384 [2021-11-06 10:33:19,561 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:33:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-06 10:33:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 317. [2021-11-06 10:33:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 306 states have (on average 1.1601307189542485) internal successors, (355), 316 states have internal predecessors, (355), 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-06 10:33:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 355 transitions. [2021-11-06 10:33:19,574 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 355 transitions. Word has length 85 [2021-11-06 10:33:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:19,575 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 355 transitions. [2021-11-06 10:33:19,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 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-06 10:33:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 355 transitions. [2021-11-06 10:33:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:33:19,576 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:19,576 INFO L513 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] [2021-11-06 10:33:19,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:33:19,576 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:33:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1192781619, now seen corresponding path program 1 times [2021-11-06 10:33:19,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:19,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675521476] [2021-11-06 10:33:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:19,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:22,770 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-06 10:33:22,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:22,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675521476] [2021-11-06 10:33:22,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675521476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:22,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:22,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:33:22,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166784443] [2021-11-06 10:33:22,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:33:22,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:33:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:33:22,772 INFO L87 Difference]: Start difference. First operand 317 states and 355 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-06 10:33:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:30,789 INFO L93 Difference]: Finished difference Result 697 states and 796 transitions. [2021-11-06 10:33:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:33:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 85 [2021-11-06 10:33:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:30,791 INFO L225 Difference]: With dead ends: 697 [2021-11-06 10:33:30,791 INFO L226 Difference]: Without dead ends: 472 [2021-11-06 10:33:30,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:33:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-06 10:33:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 317. [2021-11-06 10:33:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 306 states have (on average 1.1568627450980393) internal successors, (354), 316 states have internal predecessors, (354), 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-06 10:33:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 354 transitions. [2021-11-06 10:33:30,810 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 354 transitions. Word has length 85 [2021-11-06 10:33:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:30,811 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 354 transitions. [2021-11-06 10:33:30,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-06 10:33:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 354 transitions. [2021-11-06 10:33:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:33:30,812 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:30,812 INFO L513 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] [2021-11-06 10:33:30,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:33:30,813 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:33:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1366130194, now seen corresponding path program 1 times [2021-11-06 10:33:30,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:30,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918680246] [2021-11-06 10:33:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:30,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:31,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-06 10:33:31,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:31,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918680246] [2021-11-06 10:33:31,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918680246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:31,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:31,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:33:31,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654448112] [2021-11-06 10:33:31,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:33:31,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:33:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:33:31,310 INFO L87 Difference]: Start difference. First operand 317 states and 354 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-06 10:33:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:32,632 INFO L93 Difference]: Finished difference Result 462 states and 520 transitions. [2021-11-06 10:33:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:33:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 87 [2021-11-06 10:33:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:32,634 INFO L225 Difference]: With dead ends: 462 [2021-11-06 10:33:32,634 INFO L226 Difference]: Without dead ends: 445 [2021-11-06 10:33:32,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:33:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-06 10:33:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 329. [2021-11-06 10:33:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 318 states have (on average 1.1477987421383649) internal successors, (365), 328 states have internal predecessors, (365), 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-06 10:33:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 365 transitions. [2021-11-06 10:33:32,651 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 365 transitions. Word has length 87 [2021-11-06 10:33:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:32,652 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 365 transitions. [2021-11-06 10:33:32,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-06 10:33:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 365 transitions. [2021-11-06 10:33:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 10:33:32,653 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:32,653 INFO L513 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] [2021-11-06 10:33:32,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:33:32,653 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:33:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 904162516, now seen corresponding path program 1 times [2021-11-06 10:33:32,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:32,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956779896] [2021-11-06 10:33:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:32,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:38,633 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-06 10:33:38,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:38,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956779896] [2021-11-06 10:33:38,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956779896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:38,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:38,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:33:38,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923905580] [2021-11-06 10:33:38,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:33:38,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:33:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:33:38,635 INFO L87 Difference]: Start difference. First operand 329 states and 365 transitions. Second operand has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 21 states have internal predecessors, (88), 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-06 10:34:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:07,000 INFO L93 Difference]: Finished difference Result 617 states and 689 transitions. [2021-11-06 10:34:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:34:07,001 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 21 states have internal predecessors, (88), 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 88 [2021-11-06 10:34:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:07,002 INFO L225 Difference]: With dead ends: 617 [2021-11-06 10:34:07,002 INFO L226 Difference]: Without dead ends: 439 [2021-11-06 10:34:07,003 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2021-11-06 10:34:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-06 10:34:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 329. [2021-11-06 10:34:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 318 states have (on average 1.1446540880503144) internal successors, (364), 328 states have internal predecessors, (364), 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-06 10:34:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 364 transitions. [2021-11-06 10:34:07,019 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 364 transitions. Word has length 88 [2021-11-06 10:34:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:07,019 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 364 transitions. [2021-11-06 10:34:07,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 21 states have internal predecessors, (88), 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-06 10:34:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 364 transitions. [2021-11-06 10:34:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 10:34:07,020 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:07,021 INFO L513 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] [2021-11-06 10:34:07,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:34:07,021 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:34:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash -684185386, now seen corresponding path program 1 times [2021-11-06 10:34:07,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:07,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261222393] [2021-11-06 10:34:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:07,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:15,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-06 10:34:15,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:15,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261222393] [2021-11-06 10:34:15,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261222393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:15,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:15,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-06 10:34:15,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686519321] [2021-11-06 10:34:15,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-06 10:34:15,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-06 10:34:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:34:15,462 INFO L87 Difference]: Start difference. First operand 329 states and 364 transitions. Second operand has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 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-06 10:34:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:41,829 INFO L93 Difference]: Finished difference Result 510 states and 557 transitions. [2021-11-06 10:34:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-06 10:34:41,830 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 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 88 [2021-11-06 10:34:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:41,831 INFO L225 Difference]: With dead ends: 510 [2021-11-06 10:34:41,831 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 10:34:41,832 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=465, Invalid=1175, Unknown=0, NotChecked=0, Total=1640 [2021-11-06 10:34:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 10:34:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 349. [2021-11-06 10:34:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 338 states have (on average 1.165680473372781) internal successors, (394), 348 states have internal predecessors, (394), 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-06 10:34:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 394 transitions. [2021-11-06 10:34:41,847 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 394 transitions. Word has length 88 [2021-11-06 10:34:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:41,847 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 394 transitions. [2021-11-06 10:34:41,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 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-06 10:34:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 394 transitions. [2021-11-06 10:34:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 10:34:41,848 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:41,848 INFO L513 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-06 10:34:41,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:34:41,849 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:34:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1450616371, now seen corresponding path program 1 times [2021-11-06 10:34:41,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:41,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659150716] [2021-11-06 10:34:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:41,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:42,772 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-06 10:34:42,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:42,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659150716] [2021-11-06 10:34:42,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659150716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:42,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:42,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:34:42,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111107134] [2021-11-06 10:34:42,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:34:42,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:34:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:34:42,774 INFO L87 Difference]: Start difference. First operand 349 states and 394 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 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-06 10:34:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:50,230 INFO L93 Difference]: Finished difference Result 544 states and 611 transitions. [2021-11-06 10:34:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:34:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 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-06 10:34:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:50,233 INFO L225 Difference]: With dead ends: 544 [2021-11-06 10:34:50,233 INFO L226 Difference]: Without dead ends: 477 [2021-11-06 10:34:50,233 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:34:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-11-06 10:34:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 370. [2021-11-06 10:34:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 359 states have (on average 1.158774373259053) internal successors, (416), 369 states have internal predecessors, (416), 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-06 10:34:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 416 transitions. [2021-11-06 10:34:50,248 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 416 transitions. Word has length 90 [2021-11-06 10:34:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:50,248 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 416 transitions. [2021-11-06 10:34:50,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 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-06 10:34:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 416 transitions. [2021-11-06 10:34:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 10:34:50,249 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:50,249 INFO L513 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-06 10:34:50,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:34:50,250 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:34:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -64412977, now seen corresponding path program 1 times [2021-11-06 10:34:50,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:50,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246070795] [2021-11-06 10:34:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:50,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:54,893 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-06 10:34:54,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:54,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246070795] [2021-11-06 10:34:54,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246070795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:54,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:54,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:34:54,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093058350] [2021-11-06 10:34:54,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:34:54,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:34:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:34:54,896 INFO L87 Difference]: Start difference. First operand 370 states and 416 transitions. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 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-06 10:35:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:16,072 INFO L93 Difference]: Finished difference Result 617 states and 693 transitions. [2021-11-06 10:35:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-06 10:35:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 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-06 10:35:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:16,074 INFO L225 Difference]: With dead ends: 617 [2021-11-06 10:35:16,074 INFO L226 Difference]: Without dead ends: 613 [2021-11-06 10:35:16,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=568, Invalid=2972, Unknown=0, NotChecked=0, Total=3540 [2021-11-06 10:35:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-11-06 10:35:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 370. [2021-11-06 10:35:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 360 states have (on average 1.1611111111111112) internal successors, (418), 369 states have internal predecessors, (418), 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-06 10:35:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 418 transitions. [2021-11-06 10:35:16,095 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 418 transitions. Word has length 90 [2021-11-06 10:35:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:16,095 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 418 transitions. [2021-11-06 10:35:16,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 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-06 10:35:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 418 transitions. [2021-11-06 10:35:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:35:16,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:16,096 INFO L513 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, 1, 1] [2021-11-06 10:35:16,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:35:16,097 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:35:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1192526857, now seen corresponding path program 1 times [2021-11-06 10:35:16,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:16,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462691673] [2021-11-06 10:35:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:16,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:16,369 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-06 10:35:16,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:16,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462691673] [2021-11-06 10:35:16,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462691673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:16,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:16,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:35:16,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089877630] [2021-11-06 10:35:16,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:35:16,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:16,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:35:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:35:16,370 INFO L87 Difference]: Start difference. First operand 370 states and 418 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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-06 10:35:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:16,498 INFO L93 Difference]: Finished difference Result 457 states and 509 transitions. [2021-11-06 10:35:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:35:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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 92 [2021-11-06 10:35:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:16,500 INFO L225 Difference]: With dead ends: 457 [2021-11-06 10:35:16,500 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 10:35:16,502 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:35:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 10:35:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 367. [2021-11-06 10:35:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 357 states have (on average 1.1512605042016806) internal successors, (411), 366 states have internal predecessors, (411), 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-06 10:35:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 411 transitions. [2021-11-06 10:35:16,520 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 411 transitions. Word has length 92 [2021-11-06 10:35:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:16,521 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 411 transitions. [2021-11-06 10:35:16,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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-06 10:35:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 411 transitions. [2021-11-06 10:35:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:35:16,522 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:16,522 INFO L513 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, 1, 1, 1] [2021-11-06 10:35:16,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:35:16,522 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:35:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1685477897, now seen corresponding path program 1 times [2021-11-06 10:35:16,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:16,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446888801] [2021-11-06 10:35:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:16,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:16,879 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-06 10:35:16,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:16,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446888801] [2021-11-06 10:35:16,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446888801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:16,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:16,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:35:16,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655226181] [2021-11-06 10:35:16,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:35:16,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:35:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:35:16,881 INFO L87 Difference]: Start difference. First operand 367 states and 411 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-06 10:35:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:17,175 INFO L93 Difference]: Finished difference Result 396 states and 442 transitions. [2021-11-06 10:35:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:35:17,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-06 10:35:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:17,176 INFO L225 Difference]: With dead ends: 396 [2021-11-06 10:35:17,176 INFO L226 Difference]: Without dead ends: 394 [2021-11-06 10:35:17,176 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:35:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-06 10:35:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 365. [2021-11-06 10:35:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 356 states have (on average 1.1432584269662922) internal successors, (407), 364 states have internal predecessors, (407), 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-06 10:35:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 407 transitions. [2021-11-06 10:35:17,195 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 407 transitions. Word has length 93 [2021-11-06 10:35:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:17,196 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 407 transitions. [2021-11-06 10:35:17,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-06 10:35:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 407 transitions. [2021-11-06 10:35:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:35:17,197 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:17,197 INFO L513 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, 1, 1, 1, 1, 1] [2021-11-06 10:35:17,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:35:17,197 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:35:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -541449895, now seen corresponding path program 1 times [2021-11-06 10:35:17,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:17,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447078837] [2021-11-06 10:35:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:17,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:20,466 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-06 10:35:20,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:20,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447078837] [2021-11-06 10:35:20,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447078837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:20,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:20,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:35:20,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184767943] [2021-11-06 10:35:20,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:35:20,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:35:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:35:20,468 INFO L87 Difference]: Start difference. First operand 365 states and 407 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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-06 10:35:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:33,476 INFO L93 Difference]: Finished difference Result 455 states and 503 transitions. [2021-11-06 10:35:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:35:33,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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 95 [2021-11-06 10:35:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:33,478 INFO L225 Difference]: With dead ends: 455 [2021-11-06 10:35:33,478 INFO L226 Difference]: Without dead ends: 453 [2021-11-06 10:35:33,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:35:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-11-06 10:35:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 369. [2021-11-06 10:35:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 360 states have (on average 1.1444444444444444) internal successors, (412), 368 states have internal predecessors, (412), 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-06 10:35:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 412 transitions. [2021-11-06 10:35:33,494 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 412 transitions. Word has length 95 [2021-11-06 10:35:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:33,494 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 412 transitions. [2021-11-06 10:35:33,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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-06 10:35:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 412 transitions. [2021-11-06 10:35:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:35:33,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:33,495 INFO L513 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, 1, 1, 1, 1, 1] [2021-11-06 10:35:33,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:35:33,495 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:35:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2059414454, now seen corresponding path program 1 times [2021-11-06 10:35:33,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:33,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893707792] [2021-11-06 10:35:33,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:33,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:33,783 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-06 10:35:33,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:33,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893707792] [2021-11-06 10:35:33,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893707792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:33,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:33,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:35:33,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044412799] [2021-11-06 10:35:33,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:35:33,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:33,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:35:33,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:35:33,786 INFO L87 Difference]: Start difference. First operand 369 states and 412 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-06 10:35:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:33,906 INFO L93 Difference]: Finished difference Result 477 states and 525 transitions. [2021-11-06 10:35:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:35:33,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 95 [2021-11-06 10:35:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:33,907 INFO L225 Difference]: With dead ends: 477 [2021-11-06 10:35:33,907 INFO L226 Difference]: Without dead ends: 394 [2021-11-06 10:35:33,908 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:35:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-06 10:35:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 356. [2021-11-06 10:35:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 347 states have (on average 1.1412103746397695) internal successors, (396), 355 states have internal predecessors, (396), 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-06 10:35:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 396 transitions. [2021-11-06 10:35:33,921 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 396 transitions. Word has length 95 [2021-11-06 10:35:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:33,922 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 396 transitions. [2021-11-06 10:35:33,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-06 10:35:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 396 transitions. [2021-11-06 10:35:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 10:35:33,922 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:33,922 INFO L513 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:35:33,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 10:35:33,923 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:35:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash -642167461, now seen corresponding path program 1 times [2021-11-06 10:35:33,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:33,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111231414] [2021-11-06 10:35:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:33,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:40,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-06 10:35:40,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:40,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111231414] [2021-11-06 10:35:40,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111231414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:40,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:40,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:35:40,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203315686] [2021-11-06 10:35:40,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:35:40,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:35:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:35:40,336 INFO L87 Difference]: Start difference. First operand 356 states and 396 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 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-06 10:35:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:51,190 INFO L93 Difference]: Finished difference Result 437 states and 481 transitions. [2021-11-06 10:35:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:35:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 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 97 [2021-11-06 10:35:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:51,194 INFO L225 Difference]: With dead ends: 437 [2021-11-06 10:35:51,194 INFO L226 Difference]: Without dead ends: 435 [2021-11-06 10:35:51,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:35:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-11-06 10:35:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 358. [2021-11-06 10:35:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 349 states have (on average 1.140401146131805) internal successors, (398), 357 states have internal predecessors, (398), 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-06 10:35:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 398 transitions. [2021-11-06 10:35:51,212 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 398 transitions. Word has length 97 [2021-11-06 10:35:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:51,212 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 398 transitions. [2021-11-06 10:35:51,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 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-06 10:35:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 398 transitions. [2021-11-06 10:35:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 10:35:51,213 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:51,213 INFO L513 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:35:51,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 10:35:51,214 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:35:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -965477682, now seen corresponding path program 1 times [2021-11-06 10:35:51,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:51,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116673460] [2021-11-06 10:35:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:51,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:35:51,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:51,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116673460] [2021-11-06 10:35:51,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116673460] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:35:51,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802966069] [2021-11-06 10:35:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:51,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:35:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:35:51,874 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-06 10:35:51,877 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-06 10:35:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:52,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-06 10:35:52,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:35:52,797 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-06 10:35:53,201 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-06 10:35:53,201 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-06 10:35:53,299 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-06 10:35:53,316 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 19 treesize of output 1 [2021-11-06 10:35:54,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:54,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 24 treesize of output 23 [2021-11-06 10:35:54,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:54,314 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 26 treesize of output 14 [2021-11-06 10:35:55,044 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 45 treesize of output 44 [2021-11-06 10:35:55,052 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 34 treesize of output 22 [2021-11-06 10:35:55,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:35:55,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-11-06 10:35:56,556 INFO L354 Elim1Store]: treesize reduction 282, result has 22.3 percent of original size [2021-11-06 10:35:56,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 133 [2021-11-06 10:35:57,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:57,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2021-11-06 10:35:58,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:58,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:58,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 23 [2021-11-06 10:35:58,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:58,422 INFO L354 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2021-11-06 10:35:58,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 34 [2021-11-06 10:35:59,700 INFO L354 Elim1Store]: treesize reduction 80, result has 14.9 percent of original size [2021-11-06 10:35:59,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 79 [2021-11-06 10:36:00,259 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-06 10:36:00,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 55 [2021-11-06 10:36:00,378 INFO L354 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2021-11-06 10:36:00,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 55 [2021-11-06 10:36:15,905 INFO L354 Elim1Store]: treesize reduction 1267, result has 13.0 percent of original size [2021-11-06 10:36:15,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 64 case distinctions, treesize of input 202 treesize of output 288 [2021-11-06 10:36:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:36:41,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802966069] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:36:41,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 10:36:41,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 21 [2021-11-06 10:36:41,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394937430] [2021-11-06 10:36:41,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:36:41,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:41,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:36:41,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:36:41,097 INFO L87 Difference]: Start difference. First operand 358 states and 398 transitions. Second operand has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 21 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-06 10:36:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:59,280 INFO L93 Difference]: Finished difference Result 644 states and 714 transitions. [2021-11-06 10:36:59,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-06 10:36:59,280 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 21 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) Word has length 97 [2021-11-06 10:36:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:59,281 INFO L225 Difference]: With dead ends: 644 [2021-11-06 10:36:59,281 INFO L226 Difference]: Without dead ends: 508 [2021-11-06 10:36:59,282 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2021-11-06 10:36:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-06 10:36:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 376. [2021-11-06 10:36:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 367 states have (on average 1.1362397820163488) internal successors, (417), 375 states have internal predecessors, (417), 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-06 10:36:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 417 transitions. [2021-11-06 10:36:59,301 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 417 transitions. Word has length 97 [2021-11-06 10:36:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:59,302 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 417 transitions. [2021-11-06 10:36:59,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 21 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-06 10:36:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 417 transitions. [2021-11-06 10:36:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 10:36:59,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:59,303 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:36:59,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 10:36:59,517 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,SelfDestructingSolverStorable37 [2021-11-06 10:36:59,518 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:36:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1650650746, now seen corresponding path program 1 times [2021-11-06 10:36:59,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:59,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020239521] [2021-11-06 10:36:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:59,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:01,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-06 10:37:01,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:01,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020239521] [2021-11-06 10:37:01,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020239521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:01,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:01,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:37:01,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880973162] [2021-11-06 10:37:01,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:37:01,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:37:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:37:01,335 INFO L87 Difference]: Start difference. First operand 376 states and 417 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 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-06 10:37:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:17,306 INFO L93 Difference]: Finished difference Result 780 states and 865 transitions. [2021-11-06 10:37:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 10:37:17,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 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 98 [2021-11-06 10:37:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:17,309 INFO L225 Difference]: With dead ends: 780 [2021-11-06 10:37:17,309 INFO L226 Difference]: Without dead ends: 694 [2021-11-06 10:37:17,309 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:37:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-11-06 10:37:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 511. [2021-11-06 10:37:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 502 states have (on average 1.1274900398406376) internal successors, (566), 510 states have internal predecessors, (566), 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-06 10:37:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 566 transitions. [2021-11-06 10:37:17,336 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 566 transitions. Word has length 98 [2021-11-06 10:37:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:17,336 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 566 transitions. [2021-11-06 10:37:17,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 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-06 10:37:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 566 transitions. [2021-11-06 10:37:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 10:37:17,337 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:17,337 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:37:17,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 10:37:17,338 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:37:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1289113914, now seen corresponding path program 1 times [2021-11-06 10:37:17,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:17,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768729717] [2021-11-06 10:37:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:17,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:21,251 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-06 10:37:21,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:21,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768729717] [2021-11-06 10:37:21,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768729717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:21,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:21,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:37:21,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070535831] [2021-11-06 10:37:21,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:37:21,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:37:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:37:21,253 INFO L87 Difference]: Start difference. First operand 511 states and 566 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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-06 10:37:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:32,156 INFO L93 Difference]: Finished difference Result 575 states and 632 transitions. [2021-11-06 10:37:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:37:32,157 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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 98 [2021-11-06 10:37:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:32,158 INFO L225 Difference]: With dead ends: 575 [2021-11-06 10:37:32,158 INFO L226 Difference]: Without dead ends: 573 [2021-11-06 10:37:32,159 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:37:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-06 10:37:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 511. [2021-11-06 10:37:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 502 states have (on average 1.1254980079681276) internal successors, (565), 510 states have internal predecessors, (565), 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-06 10:37:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 565 transitions. [2021-11-06 10:37:32,185 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 565 transitions. Word has length 98 [2021-11-06 10:37:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:32,185 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 565 transitions. [2021-11-06 10:37:32,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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-06 10:37:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 565 transitions. [2021-11-06 10:37:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:37:32,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:32,186 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:37:32,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 10:37:32,187 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:37:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1352499709, now seen corresponding path program 1 times [2021-11-06 10:37:32,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:32,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834937871] [2021-11-06 10:37:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:32,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:35,741 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-06 10:37:35,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:35,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834937871] [2021-11-06 10:37:35,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834937871] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:35,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:35,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:37:35,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878951082] [2021-11-06 10:37:35,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:37:35,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:37:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:37:35,742 INFO L87 Difference]: Start difference. First operand 511 states and 565 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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-06 10:37:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:43,240 INFO L93 Difference]: Finished difference Result 598 states and 657 transitions. [2021-11-06 10:37:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:37:43,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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 99 [2021-11-06 10:37:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:43,242 INFO L225 Difference]: With dead ends: 598 [2021-11-06 10:37:43,242 INFO L226 Difference]: Without dead ends: 596 [2021-11-06 10:37:43,243 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:37:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-06 10:37:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 513. [2021-11-06 10:37:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 504 states have (on average 1.125) internal successors, (567), 512 states have internal predecessors, (567), 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-06 10:37:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 567 transitions. [2021-11-06 10:37:43,268 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 567 transitions. Word has length 99 [2021-11-06 10:37:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:43,268 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 567 transitions. [2021-11-06 10:37:43,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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-06 10:37:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 567 transitions. [2021-11-06 10:37:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:37:43,269 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:43,269 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 10:37:43,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 10:37:43,269 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:37:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1830520378, now seen corresponding path program 1 times [2021-11-06 10:37:43,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:43,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483967987] [2021-11-06 10:37:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:43,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:37:43,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:43,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483967987] [2021-11-06 10:37:43,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483967987] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:37:43,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823431771] [2021-11-06 10:37:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:43,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:37:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:37:43,846 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-06 10:37:43,846 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-06 10:37:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:44,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 85 conjunts are in the unsatisfiable core [2021-11-06 10:37:44,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:37:44,780 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-06 10:37:45,054 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-06 10:37:45,055 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-06 10:37:45,123 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-06 10:37:45,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:37:45,410 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 26 treesize of output 14 [2021-11-06 10:37:45,834 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 10:37:45,834 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 15 [2021-11-06 10:37:46,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:37:46,392 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-11-06 10:37:46,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:37:46,883 INFO L354 Elim1Store]: treesize reduction 253, result has 20.9 percent of original size [2021-11-06 10:37:46,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 150 [2021-11-06 10:37:48,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:37:48,273 INFO L354 Elim1Store]: treesize reduction 117, result has 10.7 percent of original size [2021-11-06 10:37:48,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 115 [2021-11-06 10:37:48,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:37:48,439 INFO L354 Elim1Store]: treesize reduction 115, result has 10.9 percent of original size [2021-11-06 10:37:48,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 119 [2021-11-06 10:37:48,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:37:49,742 INFO L354 Elim1Store]: treesize reduction 1065, result has 20.4 percent of original size [2021-11-06 10:37:49,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 44 case distinctions, treesize of input 159 treesize of output 358 Killed by 15