./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be64_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_be64_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 e695a989d07c92d21e9a41b59ca742c73a2098242f3cafca723523a39a7793cb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:29:00,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:29:00,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:29:00,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:29:00,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:29:00,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:29:00,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:29:00,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:29:00,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:29:00,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:29:00,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:29:00,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:29:00,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:29:00,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:29:00,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:29:00,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:29:00,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:29:00,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:29:00,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:29:00,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:29:00,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:29:00,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:29:00,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:29:00,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:29:00,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:29:00,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:29:00,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:29:00,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:29:00,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:29:00,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:29:00,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:29:00,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:29:00,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:29:00,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:29:00,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:29:00,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:29:00,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:29:00,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:29:00,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:29:00,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:29:00,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:29:00,754 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:29:00,792 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:29:00,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:29:00,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:29:00,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:29:00,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:29:00,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:29:00,798 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:29:00,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:29:00,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:29:00,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:29:00,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:29:00,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:29:00,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:29:00,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:29:00,800 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:29:00,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:29:00,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:29:00,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:29:00,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:29:00,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:29:00,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:29:00,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:29:00,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:29:00,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:29:00,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:29:00,802 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:29:00,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:29:00,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:29:00,804 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:29:00,804 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 -> e695a989d07c92d21e9a41b59ca742c73a2098242f3cafca723523a39a7793cb [2021-11-06 10:29:01,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:29:01,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:29:01,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:29:01,062 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:29:01,063 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:29:01,064 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_be64_harness.i [2021-11-06 10:29:01,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d7acf83/10cfa0f53cd7415bb3763c0155815365/FLAG4fcc1d966 [2021-11-06 10:29:01,802 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:29:01,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be64_harness.i [2021-11-06 10:29:01,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d7acf83/10cfa0f53cd7415bb3763c0155815365/FLAG4fcc1d966 [2021-11-06 10:29:02,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d7acf83/10cfa0f53cd7415bb3763c0155815365 [2021-11-06 10:29:02,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:29:02,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:29:02,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:29:02,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:29:02,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:29:02,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:02" (1/1) ... [2021-11-06 10:29:02,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3328134b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:02, skipping insertion in model container [2021-11-06 10:29:02,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:02" (1/1) ... [2021-11-06 10:29:02,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:29:02,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:29:02,511 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_be64_harness.i[4497,4510] [2021-11-06 10:29:02,518 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_be64_harness.i[4557,4570] [2021-11-06 10:29:02,545 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:29:02,554 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:29:03,212 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,213 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,213 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,214 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,215 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,227 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,228 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,230 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,231 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:29:03,498 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:29:03,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:29:03,500 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:29:03,501 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:29:03,502 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:29:03,502 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:29:03,503 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:29:03,503 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:29:03,504 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:29:03,618 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:29:03,717 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,718 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:29:03,816 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:29:03,827 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_be64_harness.i[4497,4510] [2021-11-06 10:29:03,828 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_be64_harness.i[4557,4570] [2021-11-06 10:29:03,830 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:29:03,830 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:29:03,855 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,855 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,856 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,856 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,857 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,861 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,861 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,862 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,862 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:03,904 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:29:03,905 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:29:03,906 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:29:03,906 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:29:03,907 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:29:03,907 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:29:03,908 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:29:03,908 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:29:03,909 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:29:03,909 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:29:03,944 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:29:04,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:04,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:29:04,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:29:04,290 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:29:04,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:04 WrapperNode [2021-11-06 10:29:04,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:29:04,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:29:04,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:29:04,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:29:04,298 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:04" (1/1) ... [2021-11-06 10:29:04,420 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:04" (1/1) ... [2021-11-06 10:29:04,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:29:04,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:29:04,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:29:04,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:29:04,520 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:04" (1/1) ... [2021-11-06 10:29:04,520 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:04" (1/1) ... [2021-11-06 10:29:04,542 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:04" (1/1) ... [2021-11-06 10:29:04,543 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:04" (1/1) ... [2021-11-06 10:29:04,602 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:04" (1/1) ... [2021-11-06 10:29:04,619 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:04" (1/1) ... [2021-11-06 10:29:04,626 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:04" (1/1) ... [2021-11-06 10:29:04,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:29:04,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:29:04,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:29:04,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:29:04,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:04" (1/1) ... [2021-11-06 10:29:04,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:29:04,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:29:04,685 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:04,710 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:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure htonl [2021-11-06 10:29:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:29:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:29:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:29:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:29:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:29:04,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:29:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:29:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:29:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:29:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:29:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:29:13,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:29:13,644 INFO L299 CfgBuilder]: Removed 91 assume(true) statements. [2021-11-06 10:29:13,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:13 BoogieIcfgContainer [2021-11-06 10:29:13,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:29:13,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:29:13,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:29:13,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:29:13,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:29:02" (1/3) ... [2021-11-06 10:29:13,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a089180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:13, skipping insertion in model container [2021-11-06 10:29:13,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:04" (2/3) ... [2021-11-06 10:29:13,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a089180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:13, skipping insertion in model container [2021-11-06 10:29:13,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:13" (3/3) ... [2021-11-06 10:29:13,657 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_write_be64_harness.i [2021-11-06 10:29:13,661 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:29:13,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 10:29:13,704 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:29:13,709 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:13,709 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 10:29:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 187 states have internal predecessors, (261), 0 states have call successors, (0), 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,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 10:29:13,754 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:13,755 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] [2021-11-06 10:29:13,756 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:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2035654772, now seen corresponding path program 1 times [2021-11-06 10:29:13,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:13,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714771668] [2021-11-06 10:29:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:13,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:14,399 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,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:14,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714771668] [2021-11-06 10:29:14,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714771668] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:14,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:14,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:29:14,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476539252] [2021-11-06 10:29:14,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:29:14,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:29:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:29:14,421 INFO L87 Difference]: Start difference. First operand has 188 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 187 states have internal predecessors, (261), 0 states have call successors, (0), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:14,468 INFO L93 Difference]: Finished difference Result 372 states and 517 transitions. [2021-11-06 10:29:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:29:14,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-06 10:29:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:14,482 INFO L225 Difference]: With dead ends: 372 [2021-11-06 10:29:14,482 INFO L226 Difference]: Without dead ends: 183 [2021-11-06 10:29:14,486 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:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-06 10:29:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-11-06 10:29:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 182 states have internal predecessors, (234), 0 states have call successors, (0), 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,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2021-11-06 10:29:14,537 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 41 [2021-11-06 10:29:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:14,537 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2021-11-06 10:29:14,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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,539 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2021-11-06 10:29:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 10:29:14,543 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:14,544 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] [2021-11-06 10:29:14,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:29:14,544 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:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash 911785488, now seen corresponding path program 1 times [2021-11-06 10:29:14,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:14,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162375269] [2021-11-06 10:29:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:14,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:14,931 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,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:14,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162375269] [2021-11-06 10:29:14,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162375269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:14,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:14,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:29:14,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868143244] [2021-11-06 10:29:14,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:29:14,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:29:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:29:14,934 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:15,188 INFO L93 Difference]: Finished difference Result 340 states and 434 transitions. [2021-11-06 10:29:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:29:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-06 10:29:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:15,191 INFO L225 Difference]: With dead ends: 340 [2021-11-06 10:29:15,191 INFO L226 Difference]: Without dead ends: 183 [2021-11-06 10:29:15,192 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:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-06 10:29:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-11-06 10:29:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 172 states have (on average 1.3430232558139534) internal successors, (231), 182 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:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2021-11-06 10:29:15,206 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 41 [2021-11-06 10:29:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:15,207 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2021-11-06 10:29:15,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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,207 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2021-11-06 10:29:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:29:15,214 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:15,215 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] [2021-11-06 10:29:15,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:29:15,215 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:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1949548946, now seen corresponding path program 1 times [2021-11-06 10:29:15,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:15,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980160853] [2021-11-06 10:29:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:15,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:15,577 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:15,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:15,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980160853] [2021-11-06 10:29:15,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980160853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:15,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:15,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:29:15,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798214551] [2021-11-06 10:29:15,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:29:15,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:29:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:29:15,579 INFO L87 Difference]: Start difference. First operand 183 states and 231 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:16,056 INFO L93 Difference]: Finished difference Result 401 states and 514 transitions. [2021-11-06 10:29:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:29:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 10:29:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:16,058 INFO L225 Difference]: With dead ends: 401 [2021-11-06 10:29:16,059 INFO L226 Difference]: Without dead ends: 243 [2021-11-06 10:29:16,059 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:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-06 10:29:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 195. [2021-11-06 10:29:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 184 states have (on average 1.3206521739130435) internal successors, (243), 194 states have internal predecessors, (243), 0 states have call successors, (0), 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:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2021-11-06 10:29:16,070 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 53 [2021-11-06 10:29:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:16,070 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2021-11-06 10:29:16,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2021-11-06 10:29:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:29:16,071 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:16,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] [2021-11-06 10:29:16,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:29:16,072 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:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -920189648, now seen corresponding path program 1 times [2021-11-06 10:29:16,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:16,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146431554] [2021-11-06 10:29:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:16,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:16,449 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,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:16,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146431554] [2021-11-06 10:29:16,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146431554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:16,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:16,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:29:16,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458688041] [2021-11-06 10:29:16,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:29:16,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:29:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:29:16,451 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:16,758 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2021-11-06 10:29:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:29:16,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 10:29:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:16,760 INFO L225 Difference]: With dead ends: 316 [2021-11-06 10:29:16,760 INFO L226 Difference]: Without dead ends: 195 [2021-11-06 10:29:16,761 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:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-06 10:29:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-06 10:29:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 184 states have (on average 1.315217391304348) internal successors, (242), 194 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:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 242 transitions. [2021-11-06 10:29:16,772 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 242 transitions. Word has length 53 [2021-11-06 10:29:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:16,774 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 242 transitions. [2021-11-06 10:29:16,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 242 transitions. [2021-11-06 10:29:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 10:29:16,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:16,776 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] [2021-11-06 10:29:16,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:29:16,777 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:16,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1542097477, now seen corresponding path program 1 times [2021-11-06 10:29:16,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:16,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531731113] [2021-11-06 10:29:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:16,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:29:17,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:17,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531731113] [2021-11-06 10:29:17,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531731113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:17,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:17,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:29:17,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964547051] [2021-11-06 10:29:17,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:29:17,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:17,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:29:17,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:29:17,264 INFO L87 Difference]: Start difference. First operand 195 states and 242 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:17,700 INFO L93 Difference]: Finished difference Result 267 states and 323 transitions. [2021-11-06 10:29:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:29:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 10:29:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:17,702 INFO L225 Difference]: With dead ends: 267 [2021-11-06 10:29:17,703 INFO L226 Difference]: Without dead ends: 195 [2021-11-06 10:29:17,703 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:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-06 10:29:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-06 10:29:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 194 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:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 240 transitions. [2021-11-06 10:29:17,710 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 240 transitions. Word has length 59 [2021-11-06 10:29:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:17,711 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 240 transitions. [2021-11-06 10:29:17,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 240 transitions. [2021-11-06 10:29:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 10:29:17,712 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:17,712 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] [2021-11-06 10:29:17,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:29:17,713 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:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1146198862, now seen corresponding path program 1 times [2021-11-06 10:29:17,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:17,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039648759] [2021-11-06 10:29:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:17,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:17,999 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:18,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:18,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039648759] [2021-11-06 10:29:18,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039648759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:18,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:18,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:29:18,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027773610] [2021-11-06 10:29:18,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:29:18,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:18,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:29:18,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:29:18,001 INFO L87 Difference]: Start difference. First operand 195 states and 240 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:18,512 INFO L93 Difference]: Finished difference Result 491 states and 620 transitions. [2021-11-06 10:29:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:29:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 10:29:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:18,514 INFO L225 Difference]: With dead ends: 491 [2021-11-06 10:29:18,514 INFO L226 Difference]: Without dead ends: 315 [2021-11-06 10:29:18,515 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-06 10:29:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 207. [2021-11-06 10:29:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 196 states have (on average 1.2857142857142858) internal successors, (252), 206 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2021-11-06 10:29:18,520 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 65 [2021-11-06 10:29:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:18,521 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2021-11-06 10:29:18,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2021-11-06 10:29:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 10:29:18,522 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:18,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] [2021-11-06 10:29:18,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:29:18,522 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:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1539225872, now seen corresponding path program 1 times [2021-11-06 10:29:18,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:18,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281108034] [2021-11-06 10:29:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:18,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:19,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:29:19,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:19,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281108034] [2021-11-06 10:29:19,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281108034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:19,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:19,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:29:19,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366128660] [2021-11-06 10:29:19,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:29:19,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:19,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:29:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:29:19,189 INFO L87 Difference]: Start difference. First operand 207 states and 252 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:20,012 INFO L93 Difference]: Finished difference Result 328 states and 387 transitions. [2021-11-06 10:29:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:29:20,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 10:29:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:20,014 INFO L225 Difference]: With dead ends: 328 [2021-11-06 10:29:20,014 INFO L226 Difference]: Without dead ends: 315 [2021-11-06 10:29:20,015 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:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-06 10:29:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 213. [2021-11-06 10:29:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 202 states have (on average 1.2722772277227723) internal successors, (257), 212 states have internal predecessors, (257), 0 states have call successors, (0), 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:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2021-11-06 10:29:20,020 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 65 [2021-11-06 10:29:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:20,021 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2021-11-06 10:29:20,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2021-11-06 10:29:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:29:20,022 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:20,022 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] [2021-11-06 10:29:20,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:29:20,022 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:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1637368772, now seen corresponding path program 1 times [2021-11-06 10:29:20,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:20,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593076393] [2021-11-06 10:29:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:20,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:21,075 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:21,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:21,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593076393] [2021-11-06 10:29:21,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593076393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:21,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:21,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:29:21,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695535085] [2021-11-06 10:29:21,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:29:21,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:21,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:29:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:29:21,077 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:28,693 INFO L93 Difference]: Finished difference Result 458 states and 546 transitions. [2021-11-06 10:29:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:29:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 10:29:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:28,696 INFO L225 Difference]: With dead ends: 458 [2021-11-06 10:29:28,696 INFO L226 Difference]: Without dead ends: 332 [2021-11-06 10:29:28,696 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,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-06 10:29:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 227. [2021-11-06 10:29:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 226 states have internal predecessors, (274), 0 states have call successors, (0), 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2021-11-06 10:29:28,709 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 69 [2021-11-06 10:29:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:28,710 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2021-11-06 10:29:28,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2021-11-06 10:29:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:29:28,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:28,711 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] [2021-11-06 10:29:28,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:29:28,711 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,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash 49020870, now seen corresponding path program 1 times [2021-11-06 10:29:28,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:28,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308850578] [2021-11-06 10:29:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:28,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:30,004 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:30,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:30,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308850578] [2021-11-06 10:29:30,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308850578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:30,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:30,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:29:30,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461013634] [2021-11-06 10:29:30,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:29:30,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:29:30,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:29:30,006 INFO L87 Difference]: Start difference. First operand 227 states and 274 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:41,220 INFO L93 Difference]: Finished difference Result 489 states and 583 transitions. [2021-11-06 10:29:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:29:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 10:29:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:41,222 INFO L225 Difference]: With dead ends: 489 [2021-11-06 10:29:41,222 INFO L226 Difference]: Without dead ends: 354 [2021-11-06 10:29:41,223 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:29:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-06 10:29:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 244. [2021-11-06 10:29:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.2703862660944205) internal successors, (296), 243 states have internal predecessors, (296), 0 states have call successors, (0), 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:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 296 transitions. [2021-11-06 10:29:41,231 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 296 transitions. Word has length 69 [2021-11-06 10:29:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:41,231 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 296 transitions. [2021-11-06 10:29:41,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 296 transitions. [2021-11-06 10:29:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:29:41,232 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:41,232 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] [2021-11-06 10:29:41,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:29:41,233 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:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 729079240, now seen corresponding path program 1 times [2021-11-06 10:29:41,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:41,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839853211] [2021-11-06 10:29:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:41,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:41,776 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:41,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:41,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839853211] [2021-11-06 10:29:41,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839853211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:41,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:41,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:29:41,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018813669] [2021-11-06 10:29:41,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:29:41,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:29:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:29:41,778 INFO L87 Difference]: Start difference. First operand 244 states and 296 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:44,996 INFO L93 Difference]: Finished difference Result 612 states and 738 transitions. [2021-11-06 10:29:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:29:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 10:29:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:44,999 INFO L225 Difference]: With dead ends: 612 [2021-11-06 10:29:44,999 INFO L226 Difference]: Without dead ends: 392 [2021-11-06 10:29:45,000 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:29:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-11-06 10:29:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 265. [2021-11-06 10:29:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 254 states have (on average 1.2480314960629921) internal successors, (317), 264 states have internal predecessors, (317), 0 states have call successors, (0), 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:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2021-11-06 10:29:45,010 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 69 [2021-11-06 10:29:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:45,010 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2021-11-06 10:29:45,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2021-11-06 10:29:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:29:45,012 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:45,012 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] [2021-11-06 10:29:45,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:29:45,012 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:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1482031052, now seen corresponding path program 1 times [2021-11-06 10:29:45,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:45,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186073717] [2021-11-06 10:29:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:45,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:47,797 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:47,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:47,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186073717] [2021-11-06 10:29:47,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186073717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:47,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:47,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:29:47,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405600886] [2021-11-06 10:29:47,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:29:47,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:29:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:29:47,799 INFO L87 Difference]: Start difference. First operand 265 states and 317 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:47,862 INFO L93 Difference]: Finished difference Result 462 states and 551 transitions. [2021-11-06 10:29:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:29:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 10:29:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:47,864 INFO L225 Difference]: With dead ends: 462 [2021-11-06 10:29:47,864 INFO L226 Difference]: Without dead ends: 265 [2021-11-06 10:29:47,864 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:29:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-06 10:29:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-11-06 10:29:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 254 states have (on average 1.2440944881889764) internal successors, (316), 264 states have internal predecessors, (316), 0 states have call successors, (0), 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:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 316 transitions. [2021-11-06 10:29:47,872 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 316 transitions. Word has length 69 [2021-11-06 10:29:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:47,872 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 316 transitions. [2021-11-06 10:29:47,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 316 transitions. [2021-11-06 10:29:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:29:47,873 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:47,873 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] [2021-11-06 10:29:47,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:29:47,874 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:29:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1756790666, now seen corresponding path program 1 times [2021-11-06 10:29:47,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:47,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488313604] [2021-11-06 10:29:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:47,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:50,880 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:50,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:50,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488313604] [2021-11-06 10:29:50,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488313604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:50,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:50,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:29:50,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31124190] [2021-11-06 10:29:50,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:29:50,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:29:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:29:50,882 INFO L87 Difference]: Start difference. First operand 265 states and 316 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:56,540 INFO L93 Difference]: Finished difference Result 561 states and 673 transitions. [2021-11-06 10:29:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:29:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 10:29:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:56,549 INFO L225 Difference]: With dead ends: 561 [2021-11-06 10:29:56,550 INFO L226 Difference]: Without dead ends: 328 [2021-11-06 10:29:56,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:29:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-11-06 10:29:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268. [2021-11-06 10:29:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 257 states have (on average 1.245136186770428) internal successors, (320), 267 states have internal predecessors, (320), 0 states have call successors, (0), 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:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2021-11-06 10:29:56,563 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 69 [2021-11-06 10:29:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:56,563 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2021-11-06 10:29:56,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2021-11-06 10:29:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:29:56,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:56,565 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:29:56,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:29:56,565 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:29:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1589544943, now seen corresponding path program 1 times [2021-11-06 10:29:56,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:56,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19111279] [2021-11-06 10:29:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:56,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:59,023 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:59,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:59,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19111279] [2021-11-06 10:29:59,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19111279] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:59,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:59,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:29:59,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98932220] [2021-11-06 10:29:59,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:29:59,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:29:59,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:29:59,026 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:30:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:29,299 INFO L93 Difference]: Finished difference Result 936 states and 1126 transitions. [2021-11-06 10:30:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-06 10:30:29,299 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:30:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:29,302 INFO L225 Difference]: With dead ends: 936 [2021-11-06 10:30:29,302 INFO L226 Difference]: Without dead ends: 722 [2021-11-06 10:30:29,303 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=503, Invalid=2359, Unknown=0, NotChecked=0, Total=2862 [2021-11-06 10:30:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-11-06 10:30:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 364. [2021-11-06 10:30:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.2407932011331444) internal successors, (438), 363 states have internal predecessors, (438), 0 states have call successors, (0), 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:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 438 transitions. [2021-11-06 10:30:29,323 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 438 transitions. Word has length 76 [2021-11-06 10:30:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:29,324 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 438 transitions. [2021-11-06 10:30:29,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:30:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 438 transitions. [2021-11-06 10:30:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:30:29,325 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:29,325 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:30:29,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:30:29,326 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:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash -372029715, now seen corresponding path program 1 times [2021-11-06 10:30:29,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:29,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195587597] [2021-11-06 10:30:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:29,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:30,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:30:30,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:30,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195587597] [2021-11-06 10:30:30,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195587597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:30,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:30,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:30:30,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777342561] [2021-11-06 10:30:30,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:30:30,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:30:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:30:30,310 INFO L87 Difference]: Start difference. First operand 364 states and 438 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:34,073 INFO L93 Difference]: Finished difference Result 884 states and 1056 transitions. [2021-11-06 10:30:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:30:34,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 10:30:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:34,076 INFO L225 Difference]: With dead ends: 884 [2021-11-06 10:30:34,076 INFO L226 Difference]: Without dead ends: 657 [2021-11-06 10:30:34,077 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:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-11-06 10:30:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 375. [2021-11-06 10:30:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 364 states have (on average 1.239010989010989) internal successors, (451), 374 states have internal predecessors, (451), 0 states have call successors, (0), 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:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 451 transitions. [2021-11-06 10:30:34,093 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 451 transitions. Word has length 76 [2021-11-06 10:30:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:34,093 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 451 transitions. [2021-11-06 10:30:34,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 451 transitions. [2021-11-06 10:30:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:30:34,095 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:34,095 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:30:34,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:30:34,095 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:30:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1172148337, now seen corresponding path program 1 times [2021-11-06 10:30:34,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:34,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908472383] [2021-11-06 10:30:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:34,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:35,449 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:35,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:35,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908472383] [2021-11-06 10:30:35,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908472383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:35,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:35,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:30:35,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561286668] [2021-11-06 10:30:35,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:30:35,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:30:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:30:35,452 INFO L87 Difference]: Start difference. First operand 375 states and 451 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:30:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:46,957 INFO L93 Difference]: Finished difference Result 720 states and 868 transitions. [2021-11-06 10:30:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:30:46,957 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:30:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:46,959 INFO L225 Difference]: With dead ends: 720 [2021-11-06 10:30:46,959 INFO L226 Difference]: Without dead ends: 508 [2021-11-06 10:30:46,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:30:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-06 10:30:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 373. [2021-11-06 10:30:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 362 states have (on average 1.2348066298342542) internal successors, (447), 372 states have internal predecessors, (447), 0 states have call successors, (0), 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:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 447 transitions. [2021-11-06 10:30:46,976 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 447 transitions. Word has length 76 [2021-11-06 10:30:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:46,976 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 447 transitions. [2021-11-06 10:30:46,976 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:30:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 447 transitions. [2021-11-06 10:30:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 10:30:46,977 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:46,977 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] [2021-11-06 10:30:46,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:30:46,978 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:30:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1700489080, now seen corresponding path program 1 times [2021-11-06 10:30:46,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:46,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462623346] [2021-11-06 10:30:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:46,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:47,616 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:47,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:47,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462623346] [2021-11-06 10:30:47,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462623346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:47,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:47,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:30:47,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985937086] [2021-11-06 10:30:47,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:30:47,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:30:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:30:47,618 INFO L87 Difference]: Start difference. First operand 373 states and 447 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:48,551 INFO L93 Difference]: Finished difference Result 799 states and 939 transitions. [2021-11-06 10:30:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:30:48,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-11-06 10:30:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:48,554 INFO L225 Difference]: With dead ends: 799 [2021-11-06 10:30:48,554 INFO L226 Difference]: Without dead ends: 436 [2021-11-06 10:30:48,555 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:30:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-11-06 10:30:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 369. [2021-11-06 10:30:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 358 states have (on average 1.2122905027932962) internal successors, (434), 368 states have internal predecessors, (434), 0 states have call successors, (0), 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:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 434 transitions. [2021-11-06 10:30:48,569 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 434 transitions. Word has length 77 [2021-11-06 10:30:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:48,569 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 434 transitions. [2021-11-06 10:30:48,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 434 transitions. [2021-11-06 10:30:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:30:48,570 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:48,570 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] [2021-11-06 10:30:48,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:30:48,571 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:30:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 563335530, now seen corresponding path program 1 times [2021-11-06 10:30:48,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:48,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318146047] [2021-11-06 10:30:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:48,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:49,337 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:49,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:49,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318146047] [2021-11-06 10:30:49,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318146047] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:49,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:49,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:30:49,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895700795] [2021-11-06 10:30:49,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:30:49,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:30:49,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:30:49,340 INFO L87 Difference]: Start difference. First operand 369 states and 434 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:56,439 INFO L93 Difference]: Finished difference Result 739 states and 861 transitions. [2021-11-06 10:30:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:30:56,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-11-06 10:30:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:56,441 INFO L225 Difference]: With dead ends: 739 [2021-11-06 10:30:56,442 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 10:30:56,442 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:30:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 10:30:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 277. [2021-11-06 10:30:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 266 states have (on average 1.1917293233082706) internal successors, (317), 276 states have internal predecessors, (317), 0 states have call successors, (0), 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:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2021-11-06 10:30:56,454 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 81 [2021-11-06 10:30:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:56,454 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2021-11-06 10:30:56,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2021-11-06 10:30:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:30:56,455 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:56,455 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] [2021-11-06 10:30:56,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:30:56,456 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:30:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1390225900, now seen corresponding path program 1 times [2021-11-06 10:30:56,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:56,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095229834] [2021-11-06 10:30:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:56,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:56,984 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:56,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:56,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095229834] [2021-11-06 10:30:56,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095229834] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:56,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:56,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:30:56,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406253088] [2021-11-06 10:30:56,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:30:56,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:30:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:30:56,986 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:59,918 INFO L93 Difference]: Finished difference Result 570 states and 648 transitions. [2021-11-06 10:30:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:30:59,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-11-06 10:30:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:59,920 INFO L225 Difference]: With dead ends: 570 [2021-11-06 10:30:59,920 INFO L226 Difference]: Without dead ends: 324 [2021-11-06 10:30:59,921 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:30:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-06 10:30:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 238. [2021-11-06 10:30:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 227 states have (on average 1.171806167400881) internal successors, (266), 237 states have internal predecessors, (266), 0 states have call successors, (0), 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:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2021-11-06 10:30:59,934 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 81 [2021-11-06 10:30:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:59,934 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2021-11-06 10:30:59,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2021-11-06 10:30:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:30:59,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:59,936 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] [2021-11-06 10:30:59,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:30:59,936 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:30:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1243591532, now seen corresponding path program 1 times [2021-11-06 10:30:59,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:59,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372900321] [2021-11-06 10:30:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:59,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:01,629 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:01,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:01,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372900321] [2021-11-06 10:31:01,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372900321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:01,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:01,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:31:01,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428166602] [2021-11-06 10:31:01,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:31:01,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:01,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:31:01,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:31:01,632 INFO L87 Difference]: Start difference. First operand 238 states and 266 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:19,824 INFO L93 Difference]: Finished difference Result 518 states and 573 transitions. [2021-11-06 10:31:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:31:19,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-11-06 10:31:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:19,826 INFO L225 Difference]: With dead ends: 518 [2021-11-06 10:31:19,826 INFO L226 Difference]: Without dead ends: 311 [2021-11-06 10:31:19,827 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:31:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-11-06 10:31:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 257. [2021-11-06 10:31:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 246 states have (on average 1.1585365853658536) internal successors, (285), 256 states have internal predecessors, (285), 0 states have call successors, (0), 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:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 285 transitions. [2021-11-06 10:31:19,837 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 285 transitions. Word has length 81 [2021-11-06 10:31:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:19,838 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 285 transitions. [2021-11-06 10:31:19,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 285 transitions. [2021-11-06 10:31:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:31:19,839 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:19,839 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] [2021-11-06 10:31:19,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:31:19,840 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:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 819944810, now seen corresponding path program 1 times [2021-11-06 10:31:19,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:19,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065904514] [2021-11-06 10:31:19,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:19,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:24,895 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:24,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:24,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065904514] [2021-11-06 10:31:24,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065904514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:24,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:24,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:31:24,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480592831] [2021-11-06 10:31:24,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:31:24,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:24,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:31:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:31:24,897 INFO L87 Difference]: Start difference. First operand 257 states and 285 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:37,147 INFO L93 Difference]: Finished difference Result 521 states and 578 transitions. [2021-11-06 10:31:37,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-06 10:31:37,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-11-06 10:31:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:37,149 INFO L225 Difference]: With dead ends: 521 [2021-11-06 10:31:37,149 INFO L226 Difference]: Without dead ends: 368 [2021-11-06 10:31:37,150 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:31:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-06 10:31:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 280. [2021-11-06 10:31:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 269 states have (on average 1.1486988847583643) internal successors, (309), 279 states have internal predecessors, (309), 0 states have call successors, (0), 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:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 309 transitions. [2021-11-06 10:31:37,163 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 309 transitions. Word has length 81 [2021-11-06 10:31:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:37,163 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 309 transitions. [2021-11-06 10:31:37,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 309 transitions. [2021-11-06 10:31:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 10:31:37,165 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:37,165 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] [2021-11-06 10:31:37,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:31:37,165 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:31:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2075047861, now seen corresponding path program 1 times [2021-11-06 10:31:37,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:37,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536637779] [2021-11-06 10:31:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:37,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:39,247 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:39,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:39,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536637779] [2021-11-06 10:31:39,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536637779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:39,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:39,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:31:39,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10173694] [2021-11-06 10:31:39,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:31:39,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:31:39,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:31:39,250 INFO L87 Difference]: Start difference. First operand 280 states and 309 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:01,167 INFO L93 Difference]: Finished difference Result 536 states and 593 transitions. [2021-11-06 10:32:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:32:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-11-06 10:32:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:01,170 INFO L225 Difference]: With dead ends: 536 [2021-11-06 10:32:01,171 INFO L226 Difference]: Without dead ends: 383 [2021-11-06 10:32:01,171 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2021-11-06 10:32:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-06 10:32:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 270. [2021-11-06 10:32:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 259 states have (on average 1.1544401544401544) internal successors, (299), 269 states have internal predecessors, (299), 0 states have call successors, (0), 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,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 299 transitions. [2021-11-06 10:32:01,183 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 299 transitions. Word has length 84 [2021-11-06 10:32:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:01,183 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 299 transitions. [2021-11-06 10:32:01,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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,184 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 299 transitions. [2021-11-06 10:32:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:32:01,185 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:01,185 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:32:01,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:32:01,185 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:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash -154356109, now seen corresponding path program 1 times [2021-11-06 10:32:01,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:01,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380150945] [2021-11-06 10:32:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:01,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:02,045 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,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:02,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380150945] [2021-11-06 10:32:02,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380150945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:02,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:02,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:32:02,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996220034] [2021-11-06 10:32:02,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:32:02,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:32:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:32:02,047 INFO L87 Difference]: Start difference. First operand 270 states and 299 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:32:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:05,446 INFO L93 Difference]: Finished difference Result 564 states and 632 transitions. [2021-11-06 10:32:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:32:05,447 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:32:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:05,448 INFO L225 Difference]: With dead ends: 564 [2021-11-06 10:32:05,448 INFO L226 Difference]: Without dead ends: 418 [2021-11-06 10:32:05,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:32:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-06 10:32:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 290. [2021-11-06 10:32:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 279 states have (on average 1.1433691756272402) internal successors, (319), 289 states have internal predecessors, (319), 0 states have call successors, (0), 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:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 319 transitions. [2021-11-06 10:32:05,461 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 319 transitions. Word has length 87 [2021-11-06 10:32:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:05,462 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 319 transitions. [2021-11-06 10:32:05,462 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:32:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 319 transitions. [2021-11-06 10:32:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:32:05,463 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:05,463 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:32:05,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:32:05,463 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:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1742704011, now seen corresponding path program 1 times [2021-11-06 10:32:05,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:05,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660758548] [2021-11-06 10:32:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:05,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:06,360 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:06,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:06,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660758548] [2021-11-06 10:32:06,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660758548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:06,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:06,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:32:06,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192414545] [2021-11-06 10:32:06,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:32:06,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:32:06,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:32:06,362 INFO L87 Difference]: Start difference. First operand 290 states and 319 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:32:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:16,893 INFO L93 Difference]: Finished difference Result 491 states and 545 transitions. [2021-11-06 10:32:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:32:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:32:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:16,896 INFO L225 Difference]: With dead ends: 491 [2021-11-06 10:32:16,896 INFO L226 Difference]: Without dead ends: 418 [2021-11-06 10:32:16,896 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:32:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-06 10:32:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 303. [2021-11-06 10:32:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 292 states have (on average 1.1506849315068493) internal successors, (336), 302 states have internal predecessors, (336), 0 states have call successors, (0), 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:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 336 transitions. [2021-11-06 10:32:16,909 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 336 transitions. Word has length 87 [2021-11-06 10:32:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:16,910 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 336 transitions. [2021-11-06 10:32:16,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:32:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 336 transitions. [2021-11-06 10:32:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:32:16,911 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:16,911 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:32:16,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:32:16,911 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:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -309693829, now seen corresponding path program 1 times [2021-11-06 10:32:16,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:16,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154235179] [2021-11-06 10:32:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:16,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:22,777 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:22,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:22,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154235179] [2021-11-06 10:32:22,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154235179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:22,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:22,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:32:22,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61967631] [2021-11-06 10:32:22,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:32:22,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:32:22,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:32:22,779 INFO L87 Difference]: Start difference. First operand 303 states and 336 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 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:32:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:35,878 INFO L93 Difference]: Finished difference Result 495 states and 548 transitions. [2021-11-06 10:32:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:32:35,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 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:32:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:35,879 INFO L225 Difference]: With dead ends: 495 [2021-11-06 10:32:35,880 INFO L226 Difference]: Without dead ends: 386 [2021-11-06 10:32:35,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:32:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-06 10:32:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 248. [2021-11-06 10:32:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 237 states have (on average 1.1476793248945147) internal successors, (272), 247 states have internal predecessors, (272), 0 states have call successors, (0), 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:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2021-11-06 10:32:35,891 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 87 [2021-11-06 10:32:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:35,892 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2021-11-06 10:32:35,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 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:32:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2021-11-06 10:32:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:32:35,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:35,893 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:32:35,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:32:35,893 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:35,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1768871925, now seen corresponding path program 1 times [2021-11-06 10:32:35,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:35,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159795717] [2021-11-06 10:32:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:35,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:37,271 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:37,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:37,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159795717] [2021-11-06 10:32:37,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159795717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:37,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:37,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:32:37,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21569010] [2021-11-06 10:32:37,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:32:37,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:32:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:32:37,273 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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:32:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:54,776 INFO L93 Difference]: Finished difference Result 609 states and 669 transitions. [2021-11-06 10:32:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:32:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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:32:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:54,778 INFO L225 Difference]: With dead ends: 609 [2021-11-06 10:32:54,778 INFO L226 Difference]: Without dead ends: 475 [2021-11-06 10:32:54,779 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:32:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-11-06 10:32:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 278. [2021-11-06 10:32:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 267 states have (on average 1.1348314606741574) internal successors, (303), 277 states have internal predecessors, (303), 0 states have call successors, (0), 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:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 303 transitions. [2021-11-06 10:32:54,797 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 303 transitions. Word has length 87 [2021-11-06 10:32:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:54,797 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 303 transitions. [2021-11-06 10:32:54,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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:32:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 303 transitions. [2021-11-06 10:32:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:32:54,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:54,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:32:54,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:32:54,799 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:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 180524023, now seen corresponding path program 1 times [2021-11-06 10:32:54,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:54,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830964245] [2021-11-06 10:32:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:54,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:56,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:56,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:56,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830964245] [2021-11-06 10:32:56,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830964245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:56,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:56,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:32:56,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776367119] [2021-11-06 10:32:56,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:32:56,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:32:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:32:56,586 INFO L87 Difference]: Start difference. First operand 278 states and 303 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 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:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:23,270 INFO L93 Difference]: Finished difference Result 522 states and 572 transitions. [2021-11-06 10:33:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:33:23,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 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:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:23,272 INFO L225 Difference]: With dead ends: 522 [2021-11-06 10:33:23,272 INFO L226 Difference]: Without dead ends: 378 [2021-11-06 10:33:23,272 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:33:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-11-06 10:33:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 319. [2021-11-06 10:33:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 308 states have (on average 1.12012987012987) internal successors, (345), 318 states have internal predecessors, (345), 0 states have call successors, (0), 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:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 345 transitions. [2021-11-06 10:33:23,289 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 345 transitions. Word has length 87 [2021-11-06 10:33:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:23,289 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 345 transitions. [2021-11-06 10:33:23,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 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:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 345 transitions. [2021-11-06 10:33:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:33:23,290 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:23,290 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:23,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:33:23,290 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:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 683816117, now seen corresponding path program 1 times [2021-11-06 10:33:23,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:23,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074882582] [2021-11-06 10:33:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:23,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:27,080 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:27,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:27,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074882582] [2021-11-06 10:33:27,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074882582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:27,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:27,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:33:27,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047686627] [2021-11-06 10:33:27,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:33:27,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:33:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:33:27,081 INFO L87 Difference]: Start difference. First operand 319 states and 345 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:49,542 INFO L93 Difference]: Finished difference Result 689 states and 749 transitions. [2021-11-06 10:33:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:33:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:49,544 INFO L225 Difference]: With dead ends: 689 [2021-11-06 10:33:49,544 INFO L226 Difference]: Without dead ends: 464 [2021-11-06 10:33:49,544 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:33:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-11-06 10:33:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 319. [2021-11-06 10:33:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 308 states have (on average 1.1168831168831168) internal successors, (344), 318 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:33:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 344 transitions. [2021-11-06 10:33:49,564 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 344 transitions. Word has length 87 [2021-11-06 10:33:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:49,564 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 344 transitions. [2021-11-06 10:33:49,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 344 transitions. [2021-11-06 10:33:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 10:33:49,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:49,565 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] [2021-11-06 10:33:49,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:33:49,566 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:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1415784400, now seen corresponding path program 1 times [2021-11-06 10:33:49,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:49,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201871599] [2021-11-06 10:33:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:49,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:50,013 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:50,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:50,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201871599] [2021-11-06 10:33:50,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201871599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:50,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:50,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:33:50,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951949910] [2021-11-06 10:33:50,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:33:50,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:50,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:33:50,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:33:50,014 INFO L87 Difference]: Start difference. First operand 319 states and 344 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:51,314 INFO L93 Difference]: Finished difference Result 428 states and 462 transitions. [2021-11-06 10:33:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:33:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-11-06 10:33:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:51,315 INFO L225 Difference]: With dead ends: 428 [2021-11-06 10:33:51,316 INFO L226 Difference]: Without dead ends: 411 [2021-11-06 10:33:51,316 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:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-11-06 10:33:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 327. [2021-11-06 10:33:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 316 states have (on average 1.110759493670886) internal successors, (351), 326 states have internal predecessors, (351), 0 states have call successors, (0), 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:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 351 transitions. [2021-11-06 10:33:51,329 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 351 transitions. Word has length 89 [2021-11-06 10:33:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:51,329 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 351 transitions. [2021-11-06 10:33:51,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 351 transitions. [2021-11-06 10:33:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 10:33:51,330 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:51,330 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:33:51,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:33:51,330 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:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1801234922, now seen corresponding path program 1 times [2021-11-06 10:33:51,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:51,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487939460] [2021-11-06 10:33:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:51,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:59,472 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:59,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:59,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487939460] [2021-11-06 10:33:59,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487939460] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:59,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:59,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-06 10:33:59,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239806242] [2021-11-06 10:33:59,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 10:33:59,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 10:33:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:33:59,476 INFO L87 Difference]: Start difference. First operand 327 states and 351 transitions. Second operand has 20 states, 20 states have (on average 4.5) internal successors, (90), 20 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:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:17,717 INFO L93 Difference]: Finished difference Result 540 states and 582 transitions. [2021-11-06 10:34:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:34:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.5) internal successors, (90), 20 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:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:17,719 INFO L225 Difference]: With dead ends: 540 [2021-11-06 10:34:17,719 INFO L226 Difference]: Without dead ends: 467 [2021-11-06 10:34:17,720 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=374, Invalid=886, Unknown=0, NotChecked=0, Total=1260 [2021-11-06 10:34:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-11-06 10:34:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 340. [2021-11-06 10:34:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 329 states have (on average 1.1398176291793314) internal successors, (375), 339 states have internal predecessors, (375), 0 states have call successors, (0), 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:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 375 transitions. [2021-11-06 10:34:17,740 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 375 transitions. Word has length 90 [2021-11-06 10:34:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:17,741 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 375 transitions. [2021-11-06 10:34:17,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.5) internal successors, (90), 20 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:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 375 transitions. [2021-11-06 10:34:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:34:17,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:17,742 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:34:17,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:34:17,742 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:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1412627311, now seen corresponding path program 1 times [2021-11-06 10:34:17,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:17,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182087432] [2021-11-06 10:34:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:17,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:18,666 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:18,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:18,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182087432] [2021-11-06 10:34:18,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182087432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:18,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:18,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:34:18,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286181155] [2021-11-06 10:34:18,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:34:18,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:34:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:34:18,668 INFO L87 Difference]: Start difference. First operand 340 states and 375 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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:34:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:26,242 INFO L93 Difference]: Finished difference Result 549 states and 611 transitions. [2021-11-06 10:34:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:34:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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:34:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:26,244 INFO L225 Difference]: With dead ends: 549 [2021-11-06 10:34:26,244 INFO L226 Difference]: Without dead ends: 475 [2021-11-06 10:34:26,244 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:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-11-06 10:34:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 340. [2021-11-06 10:34:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 329 states have (on average 1.1398176291793314) internal successors, (375), 339 states have internal predecessors, (375), 0 states have call successors, (0), 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:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 375 transitions. [2021-11-06 10:34:26,260 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 375 transitions. Word has length 92 [2021-11-06 10:34:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:26,260 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 375 transitions. [2021-11-06 10:34:26,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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:34:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 375 transitions. [2021-11-06 10:34:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:34:26,261 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:26,262 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:34:26,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:34:26,262 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:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash 192807151, now seen corresponding path program 1 times [2021-11-06 10:34:26,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:26,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632695612] [2021-11-06 10:34:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:26,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:31,015 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:31,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:31,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632695612] [2021-11-06 10:34:31,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632695612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:31,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:31,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:34:31,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259875375] [2021-11-06 10:34:31,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:34:31,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:34:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:34:31,017 INFO L87 Difference]: Start difference. First operand 340 states and 375 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 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:34:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:47,019 INFO L93 Difference]: Finished difference Result 575 states and 633 transitions. [2021-11-06 10:34:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-06 10:34:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 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:34:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:47,025 INFO L225 Difference]: With dead ends: 575 [2021-11-06 10:34:47,025 INFO L226 Difference]: Without dead ends: 571 [2021-11-06 10:34:47,026 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=551, Invalid=2871, Unknown=0, NotChecked=0, Total=3422 [2021-11-06 10:34:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-06 10:34:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 340. [2021-11-06 10:34:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.1424242424242423) internal successors, (377), 339 states have internal predecessors, (377), 0 states have call successors, (0), 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:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 377 transitions. [2021-11-06 10:34:47,047 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 377 transitions. Word has length 92 [2021-11-06 10:34:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:47,047 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 377 transitions. [2021-11-06 10:34:47,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 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:34:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 377 transitions. [2021-11-06 10:34:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 10:34:47,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:47,049 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] [2021-11-06 10:34:47,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:34:47,049 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:34:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash -722458194, now seen corresponding path program 1 times [2021-11-06 10:34:47,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:47,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142551701] [2021-11-06 10:34:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:47,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:47,344 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:47,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:47,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142551701] [2021-11-06 10:34:47,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142551701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:47,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:47,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:34:47,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244480609] [2021-11-06 10:34:47,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:34:47,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:34:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:34:47,345 INFO L87 Difference]: Start difference. First operand 340 states and 377 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:47,473 INFO L93 Difference]: Finished difference Result 398 states and 428 transitions. [2021-11-06 10:34:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:34:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-06 10:34:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:47,475 INFO L225 Difference]: With dead ends: 398 [2021-11-06 10:34:47,475 INFO L226 Difference]: Without dead ends: 360 [2021-11-06 10:34:47,476 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:34:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-06 10:34:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 334. [2021-11-06 10:34:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.132716049382716) internal successors, (367), 333 states have internal predecessors, (367), 0 states have call successors, (0), 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:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 367 transitions. [2021-11-06 10:34:47,496 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 367 transitions. Word has length 94 [2021-11-06 10:34:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:47,496 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 367 transitions. [2021-11-06 10:34:47,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 367 transitions. [2021-11-06 10:34:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:34:47,497 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:47,497 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:34:47,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:34:47,498 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:34:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash -920472327, now seen corresponding path program 1 times [2021-11-06 10:34:47,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:47,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670609692] [2021-11-06 10:34:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:47,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:47,988 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:47,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:47,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670609692] [2021-11-06 10:34:47,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670609692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:47,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:47,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:34:47,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218426659] [2021-11-06 10:34:47,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:34:47,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:47,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:34:47,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:34:47,990 INFO L87 Difference]: Start difference. First operand 334 states and 367 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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:34:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:48,345 INFO L93 Difference]: Finished difference Result 360 states and 395 transitions. [2021-11-06 10:34:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:34:48,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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:34:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:48,347 INFO L225 Difference]: With dead ends: 360 [2021-11-06 10:34:48,347 INFO L226 Difference]: Without dead ends: 358 [2021-11-06 10:34:48,347 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:34:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-06 10:34:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 332. [2021-11-06 10:34:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 323 states have (on average 1.1269349845201238) internal successors, (364), 331 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:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 364 transitions. [2021-11-06 10:34:48,361 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 364 transitions. Word has length 95 [2021-11-06 10:34:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:48,362 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 364 transitions. [2021-11-06 10:34:48,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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:34:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 364 transitions. [2021-11-06 10:34:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 10:34:48,363 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:48,363 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:34:48,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:34:48,364 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:34:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1328469076, now seen corresponding path program 1 times [2021-11-06 10:34:48,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:48,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844752877] [2021-11-06 10:34:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:48,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:48,773 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:48,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:48,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844752877] [2021-11-06 10:34:48,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844752877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:48,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:48,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:34:48,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466946676] [2021-11-06 10:34:48,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:34:48,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:34:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:34:48,775 INFO L87 Difference]: Start difference. First operand 332 states and 364 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:34:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:48,940 INFO L93 Difference]: Finished difference Result 434 states and 468 transitions. [2021-11-06 10:34:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:34:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:34:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:48,942 INFO L225 Difference]: With dead ends: 434 [2021-11-06 10:34:48,942 INFO L226 Difference]: Without dead ends: 344 [2021-11-06 10:34:48,942 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:34:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-11-06 10:34:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 319. [2021-11-06 10:34:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 310 states have (on average 1.1225806451612903) internal successors, (348), 318 states have internal predecessors, (348), 0 states have call successors, (0), 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:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2021-11-06 10:34:48,960 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 97 [2021-11-06 10:34:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:48,960 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2021-11-06 10:34:48,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:34:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2021-11-06 10:34:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 10:34:48,961 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:48,961 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:34:48,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:34:48,962 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:34:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash 189495483, now seen corresponding path program 1 times [2021-11-06 10:34:48,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:48,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798429855] [2021-11-06 10:34:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:48,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:53,312 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:53,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:53,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798429855] [2021-11-06 10:34:53,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798429855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:53,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:53,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:34:53,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533613544] [2021-11-06 10:34:53,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:34:53,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:53,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:34:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:34:53,314 INFO L87 Difference]: Start difference. First operand 319 states and 348 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:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:04,745 INFO L93 Difference]: Finished difference Result 441 states and 478 transitions. [2021-11-06 10:35:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:35:04,746 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:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:04,747 INFO L225 Difference]: With dead ends: 441 [2021-11-06 10:35:04,747 INFO L226 Difference]: Without dead ends: 439 [2021-11-06 10:35:04,747 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:35:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-06 10:35:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 354. [2021-11-06 10:35:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 345 states have (on average 1.1159420289855073) internal successors, (385), 353 states have internal predecessors, (385), 0 states have call successors, (0), 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:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 385 transitions. [2021-11-06 10:35:04,769 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 385 transitions. Word has length 97 [2021-11-06 10:35:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:04,769 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 385 transitions. [2021-11-06 10:35:04,770 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:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 385 transitions. [2021-11-06 10:35:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:35:04,771 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:04,771 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:35:04,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:35:04,771 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:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1393361552, now seen corresponding path program 1 times [2021-11-06 10:35:04,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:04,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318699670] [2021-11-06 10:35:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:04,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:05,644 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:05,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:05,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318699670] [2021-11-06 10:35:05,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318699670] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:35:05,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752887724] [2021-11-06 10:35:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:05,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:35:05,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:35:05,646 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:05,647 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:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:06,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 3077 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-06 10:35:06,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:35:06,838 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:07,256 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-06 10:35:07,256 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:07,384 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:07,405 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:08,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:08,476 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 22 treesize of output 21 [2021-11-06 10:35:08,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:08,502 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 12 [2021-11-06 10:35:09,454 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-06 10:35:09,455 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 48 treesize of output 47 [2021-11-06 10:35:09,502 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 10:35:09,503 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 37 treesize of output 25 [2021-11-06 10:35:10,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:35:10,347 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:11,031 INFO L354 Elim1Store]: treesize reduction 282, result has 22.3 percent of original size [2021-11-06 10:35:11,032 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:12,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:12,282 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:12,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:12,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:12,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:12,527 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:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:35:12,816 INFO L354 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2021-11-06 10:35:12,817 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:14,103 INFO L354 Elim1Store]: treesize reduction 80, result has 14.9 percent of original size [2021-11-06 10:35:14,103 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:35:14,568 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-06 10:35:14,569 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:35:14,662 INFO L354 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2021-11-06 10:35:14,663 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:35:31,466 INFO L354 Elim1Store]: treesize reduction 1267, result has 13.0 percent of original size [2021-11-06 10:35:31,467 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:35:59,590 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:59,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752887724] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:35:59,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 10:35:59,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 21 [2021-11-06 10:35:59,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40725924] [2021-11-06 10:35:59,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:35:59,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:35:59,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:35:59,593 INFO L87 Difference]: Start difference. First operand 354 states and 385 transitions. Second operand has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:18,383 INFO L93 Difference]: Finished difference Result 633 states and 685 transitions. [2021-11-06 10:36:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-06 10:36:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 10:36:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:18,386 INFO L225 Difference]: With dead ends: 633 [2021-11-06 10:36:18,386 INFO L226 Difference]: Without dead ends: 533 [2021-11-06 10:36:18,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2021-11-06 10:36:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-11-06 10:36:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 385. [2021-11-06 10:36:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 376 states have (on average 1.122340425531915) internal successors, (422), 384 states have internal predecessors, (422), 0 states have call successors, (0), 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:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 422 transitions. [2021-11-06 10:36:18,416 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 422 transitions. Word has length 99 [2021-11-06 10:36:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:18,417 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 422 transitions. [2021-11-06 10:36:18,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 422 transitions. [2021-11-06 10:36:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:36:18,418 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:18,418 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:36:18,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-06 10:36:18,631 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,SelfDestructingSolverStorable35 [2021-11-06 10:36:18,631 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:36:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1716671773, now seen corresponding path program 1 times [2021-11-06 10:36:18,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:18,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228743463] [2021-11-06 10:36:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:18,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:36:26,258 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:36:26,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:36:26,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228743463] [2021-11-06 10:36:26,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228743463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:36:26,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:36:26,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:36:26,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325721485] [2021-11-06 10:36:26,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:36:26,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:36:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:36:26,260 INFO L87 Difference]: Start difference. First operand 385 states and 422 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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:36:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:40,927 INFO L93 Difference]: Finished difference Result 407 states and 440 transitions. [2021-11-06 10:36:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:36:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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:36:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:40,929 INFO L225 Difference]: With dead ends: 407 [2021-11-06 10:36:40,929 INFO L226 Difference]: Without dead ends: 405 [2021-11-06 10:36:40,930 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=377, Invalid=1105, Unknown=0, NotChecked=0, Total=1482 [2021-11-06 10:36:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-11-06 10:36:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 385. [2021-11-06 10:36:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 376 states have (on average 1.1196808510638299) internal successors, (421), 384 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:36:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 421 transitions. [2021-11-06 10:36:40,959 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 421 transitions. Word has length 99 [2021-11-06 10:36:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:40,959 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 421 transitions. [2021-11-06 10:36:40,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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:36:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 421 transitions. [2021-11-06 10:36:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 10:36:40,961 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:40,961 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, 1] [2021-11-06 10:36:40,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 10:36:40,961 INFO L402 AbstractCegarLoop]: === Iteration 38 === 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:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2030730852, now seen corresponding path program 1 times [2021-11-06 10:36:40,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:40,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163625801] [2021-11-06 10:36:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:40,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:36:42,897 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:36:42,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:36:42,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163625801] [2021-11-06 10:36:42,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163625801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:36:42,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:36:42,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:36:42,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435487615] [2021-11-06 10:36:42,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:36:42,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:36:42,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:36:42,900 INFO L87 Difference]: Start difference. First operand 385 states and 421 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 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:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:02,358 INFO L93 Difference]: Finished difference Result 538 states and 590 transitions. [2021-11-06 10:37:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:37:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-06 10:37:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:02,360 INFO L225 Difference]: With dead ends: 538 [2021-11-06 10:37:02,360 INFO L226 Difference]: Without dead ends: 372 [2021-11-06 10:37:02,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:37:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-06 10:37:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2021-11-06 10:37:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 355 states have (on average 1.115492957746479) internal successors, (396), 363 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:37:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 396 transitions. [2021-11-06 10:37:02,378 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 396 transitions. Word has length 100 [2021-11-06 10:37:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:02,378 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 396 transitions. [2021-11-06 10:37:02,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 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:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 396 transitions. [2021-11-06 10:37:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 10:37:02,379 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:02,379 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, 1] [2021-11-06 10:37:02,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 10:37:02,379 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:37:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash -20528422, now seen corresponding path program 1 times [2021-11-06 10:37:02,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:02,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348157693] [2021-11-06 10:37:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:02,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:08,304 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:08,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:08,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348157693] [2021-11-06 10:37:08,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348157693] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:08,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:08,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:37:08,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056525944] [2021-11-06 10:37:08,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:37:08,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:37:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:37:08,309 INFO L87 Difference]: Start difference. First operand 364 states and 396 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:36,031 INFO L93 Difference]: Finished difference Result 545 states and 582 transitions. [2021-11-06 10:37:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:37:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-06 10:37:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:36,033 INFO L225 Difference]: With dead ends: 545 [2021-11-06 10:37:36,034 INFO L226 Difference]: Without dead ends: 543 [2021-11-06 10:37:36,034 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:37:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-06 10:37:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2021-11-06 10:37:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 380 states have (on average 1.1131578947368421) internal successors, (423), 388 states have internal predecessors, (423), 0 states have call successors, (0), 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:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 423 transitions. [2021-11-06 10:37:36,061 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 423 transitions. Word has length 100 [2021-11-06 10:37:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:36,062 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 423 transitions. [2021-11-06 10:37:36,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 423 transitions. [2021-11-06 10:37:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 10:37:36,063 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:36,063 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, 1] [2021-11-06 10:37:36,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 10:37:36,064 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:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1902699612, now seen corresponding path program 1 times [2021-11-06 10:37:36,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:36,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594938118] [2021-11-06 10:37:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:36,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:40,444 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:40,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:40,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594938118] [2021-11-06 10:37:40,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594938118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:40,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:40,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:37:40,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723200833] [2021-11-06 10:37:40,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:37:40,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:37:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:37:40,446 INFO L87 Difference]: Start difference. First operand 389 states and 423 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 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:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:57,591 INFO L93 Difference]: Finished difference Result 455 states and 488 transitions. [2021-11-06 10:37:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:37:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-06 10:37:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:57,593 INFO L225 Difference]: With dead ends: 455 [2021-11-06 10:37:57,593 INFO L226 Difference]: Without dead ends: 453 [2021-11-06 10:37:57,593 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:37:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-11-06 10:37:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 364. [2021-11-06 10:37:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 355 states have (on average 1.1126760563380282) internal successors, (395), 363 states have internal predecessors, (395), 0 states have call successors, (0), 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:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 395 transitions. [2021-11-06 10:37:57,618 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 395 transitions. Word has length 100 [2021-11-06 10:37:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:57,618 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 395 transitions. [2021-11-06 10:37:57,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 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:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 395 transitions. [2021-11-06 10:37:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-06 10:37:57,619 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:57,619 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, 1, 1] [2021-11-06 10:37:57,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 10:37:57,620 INFO L402 AbstractCegarLoop]: === Iteration 41 === 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:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1566218728, now seen corresponding path program 1 times [2021-11-06 10:37:57,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:57,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247279284] [2021-11-06 10:37:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:57,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:58,329 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:58,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:58,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247279284] [2021-11-06 10:37:58,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247279284] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:37:58,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537453768] [2021-11-06 10:37:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:58,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:37:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:37:58,331 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:58,332 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:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:59,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 77 conjunts are in the unsatisfiable core [2021-11-06 10:37:59,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:37:59,376 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:59,745 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-06 10:37:59,746 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:59,856 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:38:00,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:38:00,286 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 12 [2021-11-06 10:38:00,912 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 10:38:00,913 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:38:01,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:38:01,749 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:38:02,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:38:02,428 INFO L354 Elim1Store]: treesize reduction 253, result has 20.9 percent of original size [2021-11-06 10:38:02,428 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:38:04,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:38:04,178 INFO L354 Elim1Store]: treesize reduction 117, result has 10.7 percent of original size [2021-11-06 10:38:04,178 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:38:04,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:38:04,373 INFO L354 Elim1Store]: treesize reduction 115, result has 10.9 percent of original size [2021-11-06 10:38:04,374 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:38:04,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:38:06,104 INFO L354 Elim1Store]: treesize reduction 1065, result has 20.4 percent of original size [2021-11-06 10:38:06,105 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