./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_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_cursor_advance_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 f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:30:00,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:30:00,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:30:00,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:30:00,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:30:00,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:30:00,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:30:00,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:30:00,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:30:00,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:30:00,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:30:00,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:30:00,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:30:00,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:30:00,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:30:00,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:30:00,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:30:00,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:30:00,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:30:00,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:30:00,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:30:00,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:30:00,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:30:00,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:30:00,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:30:00,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:30:00,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:30:00,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:30:00,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:30:00,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:30:00,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:30:00,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:30:00,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:30:00,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:30:00,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:30:00,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:30:00,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:30:00,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:30:00,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:30:00,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:30:00,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:30:00,763 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:30:00,777 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:30:00,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:30:00,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:30:00,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:30:00,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:30:00,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:30:00,779 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:30:00,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:30:00,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:30:00,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:30:00,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:30:00,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:30:00,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:30:00,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:30:00,781 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:30:00,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:30:00,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:30:00,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:30:00,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:30:00,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:30:00,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:30:00,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:30:00,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:30:00,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:30:00,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:30:00,782 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:30:00,782 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:30:00,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:30:00,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:30:00,783 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 -> f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 [2021-11-06 10:30:00,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:30:00,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:30:00,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:30:00,988 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:30:00,989 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:30:00,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2021-11-06 10:30:01,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458320e6b/32c869a785c44930a8b49f2bc29d3593/FLAG7aa5d572d [2021-11-06 10:30:01,597 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:30:01,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2021-11-06 10:30:01,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458320e6b/32c869a785c44930a8b49f2bc29d3593/FLAG7aa5d572d [2021-11-06 10:30:02,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458320e6b/32c869a785c44930a8b49f2bc29d3593 [2021-11-06 10:30:02,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:30:02,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:30:02,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:30:02,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:30:02,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:30:02,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:02" (1/1) ... [2021-11-06 10:30:02,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59de24c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:02, skipping insertion in model container [2021-11-06 10:30:02,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:02" (1/1) ... [2021-11-06 10:30:02,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:30:02,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:30:02,407 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_cursor_advance_harness.i[4497,4510] [2021-11-06 10:30:02,411 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_cursor_advance_harness.i[4557,4570] [2021-11-06 10:30:02,424 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:30:02,428 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:30:02,979 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,980 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,980 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,981 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,981 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,995 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,995 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,996 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:02,997 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,204 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:30:03,206 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:30:03,216 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:30:03,217 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:30:03,218 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:30:03,219 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:30:03,219 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:30:03,222 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:30:03,223 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:30:03,223 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:30:03,338 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:30:03,429 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,430 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:30:03,544 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:30:03,560 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_cursor_advance_harness.i[4497,4510] [2021-11-06 10:30:03,561 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_cursor_advance_harness.i[4557,4570] [2021-11-06 10:30:03,563 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:30:03,564 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:30:03,585 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,593 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,593 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,594 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,594 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,622 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:30:03,622 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:30:03,623 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:30:03,623 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:30:03,624 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:30:03,624 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:30:03,624 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:30:03,626 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:30:03,626 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:30:03,626 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:30:03,644 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:30:03,687 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,688 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:30:03,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:30:03,883 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:30:03,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03 WrapperNode [2021-11-06 10:30:03,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:30:03,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:30:03,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:30:03,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:30:03,890 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:30:03" (1/1) ... [2021-11-06 10:30:03,976 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:30:03" (1/1) ... [2021-11-06 10:30:04,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:30:04,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:30:04,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:30:04,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:30:04,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:30:04,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:30:04,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:30:04,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:30:04,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (1/1) ... [2021-11-06 10:30:04,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:30:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:30:04,149 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:30:04,167 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:30:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:30:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:30:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:30:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:30:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:30:04,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:30:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:30:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:30:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:30:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:30:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:30:11,564 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:30:11,565 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-11-06 10:30:11,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:11 BoogieIcfgContainer [2021-11-06 10:30:11,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:30:11,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:30:11,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:30:11,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:30:11,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:30:02" (1/3) ... [2021-11-06 10:30:11,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567afe18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:11, skipping insertion in model container [2021-11-06 10:30:11,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03" (2/3) ... [2021-11-06 10:30:11,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567afe18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:11, skipping insertion in model container [2021-11-06 10:30:11,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:11" (3/3) ... [2021-11-06 10:30:11,572 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_harness.i [2021-11-06 10:30:11,575 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:30:11,575 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-11-06 10:30:11,625 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:30:11,629 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:30:11,630 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-06 10:30:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 126 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:30:11,644 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:11,645 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] [2021-11-06 10:30:11,645 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash -443327314, now seen corresponding path program 1 times [2021-11-06 10:30:11,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:11,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412323139] [2021-11-06 10:30:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:11,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:12,164 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:12,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:12,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412323139] [2021-11-06 10:30:12,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412323139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:12,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:12,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:30:12,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217608121] [2021-11-06 10:30:12,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:30:12,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:30:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:30:12,184 INFO L87 Difference]: Start difference. First operand has 127 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 126 states have internal predecessors, (173), 0 states have call successors, (0), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:12,347 INFO L93 Difference]: Finished difference Result 249 states and 339 transitions. [2021-11-06 10:30:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:30:12,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-06 10:30:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:12,353 INFO L225 Difference]: With dead ends: 249 [2021-11-06 10:30:12,353 INFO L226 Difference]: Without dead ends: 119 [2021-11-06 10:30:12,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:30:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-06 10:30:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-06 10:30:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-11-06 10:30:12,393 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 26 [2021-11-06 10:30:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:12,393 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-11-06 10:30:12,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-11-06 10:30:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 10:30:12,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:12,395 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] [2021-11-06 10:30:12,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:30:12,395 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1924042484, now seen corresponding path program 1 times [2021-11-06 10:30:12,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:12,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597358888] [2021-11-06 10:30:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:12,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:12,679 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:12,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:12,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597358888] [2021-11-06 10:30:12,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597358888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:12,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:12,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:30:12,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724454214] [2021-11-06 10:30:12,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:30:12,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:12,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:30:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:30:12,682 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:12,908 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2021-11-06 10:30:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:30:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-06 10:30:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:12,909 INFO L225 Difference]: With dead ends: 186 [2021-11-06 10:30:12,909 INFO L226 Difference]: Without dead ends: 119 [2021-11-06 10:30:12,910 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:30:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-06 10:30:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-06 10:30:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 118 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-11-06 10:30:12,920 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 30 [2021-11-06 10:30:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:12,920 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-11-06 10:30:12,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-11-06 10:30:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 10:30:12,922 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:12,922 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:30:12,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:30:12,922 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:12,923 INFO L85 PathProgramCache]: Analyzing trace with hash 434837223, now seen corresponding path program 1 times [2021-11-06 10:30:12,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:12,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694181798] [2021-11-06 10:30:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:12,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:30:13,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:13,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694181798] [2021-11-06 10:30:13,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694181798] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:13,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:13,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:30:13,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172348552] [2021-11-06 10:30:13,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:30:13,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:30:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:30:13,468 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:14,205 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2021-11-06 10:30:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:30:14,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-06 10:30:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:14,207 INFO L225 Difference]: With dead ends: 217 [2021-11-06 10:30:14,207 INFO L226 Difference]: Without dead ends: 211 [2021-11-06 10:30:14,207 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:30:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-06 10:30:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 131. [2021-11-06 10:30:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 130 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2021-11-06 10:30:14,214 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 32 [2021-11-06 10:30:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:14,214 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2021-11-06 10:30:14,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2021-11-06 10:30:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:30:14,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:14,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] [2021-11-06 10:30:14,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:30:14,216 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2134165153, now seen corresponding path program 1 times [2021-11-06 10:30:14,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:14,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85444876] [2021-11-06 10:30:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:14,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:15,370 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:15,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:15,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85444876] [2021-11-06 10:30:15,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85444876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:15,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:15,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:30:15,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442402971] [2021-11-06 10:30:15,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:30:15,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:30:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:30:15,372 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:33,418 INFO L93 Difference]: Finished difference Result 339 states and 402 transitions. [2021-11-06 10:30:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:30:33,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:30:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:33,420 INFO L225 Difference]: With dead ends: 339 [2021-11-06 10:30:33,420 INFO L226 Difference]: Without dead ends: 231 [2021-11-06 10:30:33,421 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:30:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-06 10:30:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 150. [2021-11-06 10:30:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 149 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2021-11-06 10:30:33,428 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 36 [2021-11-06 10:30:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:33,428 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2021-11-06 10:30:33,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2021-11-06 10:30:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:30:33,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:33,429 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] [2021-11-06 10:30:33,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:30:33,429 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1573996129, now seen corresponding path program 1 times [2021-11-06 10:30:33,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:33,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658691993] [2021-11-06 10:30:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:33,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:33,597 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:33,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:33,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658691993] [2021-11-06 10:30:33,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658691993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:33,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:33,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 10:30:33,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614238325] [2021-11-06 10:30:33,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 10:30:33,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 10:30:33,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:30:33,607 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:33,638 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2021-11-06 10:30:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 10:30:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:30:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:33,643 INFO L225 Difference]: With dead ends: 241 [2021-11-06 10:30:33,643 INFO L226 Difference]: Without dead ends: 152 [2021-11-06 10:30:33,643 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:30:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-06 10:30:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-06 10:30:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.267605633802817) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2021-11-06 10:30:33,655 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 36 [2021-11-06 10:30:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:33,656 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2021-11-06 10:30:33,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-11-06 10:30:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:30:33,659 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:33,659 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] [2021-11-06 10:30:33,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:30:33,659 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 562878879, now seen corresponding path program 1 times [2021-11-06 10:30:33,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:33,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362710933] [2021-11-06 10:30:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:33,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:34,906 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:34,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:34,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362710933] [2021-11-06 10:30:34,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362710933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:34,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:34,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:30:34,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739414795] [2021-11-06 10:30:34,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:30:34,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:34,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:30:34,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:30:34,908 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:50,403 INFO L93 Difference]: Finished difference Result 343 states and 402 transitions. [2021-11-06 10:30:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-06 10:30:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:30:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:50,405 INFO L225 Difference]: With dead ends: 343 [2021-11-06 10:30:50,405 INFO L226 Difference]: Without dead ends: 261 [2021-11-06 10:30:50,406 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=341, Invalid=1141, Unknown=0, NotChecked=0, Total=1482 [2021-11-06 10:30:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-06 10:30:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 152. [2021-11-06 10:30:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.267605633802817) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2021-11-06 10:30:50,411 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 36 [2021-11-06 10:30:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:50,411 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2021-11-06 10:30:50,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-11-06 10:30:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 10:30:50,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:50,413 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] [2021-11-06 10:30:50,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:30:50,413 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1581952149, now seen corresponding path program 1 times [2021-11-06 10:30:50,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:50,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370594529] [2021-11-06 10:30:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:50,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:50,645 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:50,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:50,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370594529] [2021-11-06 10:30:50,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370594529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:50,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:50,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:30:50,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994930860] [2021-11-06 10:30:50,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:30:50,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:50,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:30:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:30:50,647 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:50,762 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-11-06 10:30:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:30:50,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-06 10:30:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:50,763 INFO L225 Difference]: With dead ends: 208 [2021-11-06 10:30:50,763 INFO L226 Difference]: Without dead ends: 152 [2021-11-06 10:30:50,764 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:30:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-06 10:30:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-06 10:30:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 151 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2021-11-06 10:30:50,773 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 37 [2021-11-06 10:30:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:50,774 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2021-11-06 10:30:50,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2021-11-06 10:30:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 10:30:50,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:50,777 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] [2021-11-06 10:30:50,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:30:50,778 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -185094105, now seen corresponding path program 1 times [2021-11-06 10:30:50,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:50,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020374262] [2021-11-06 10:30:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:50,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:51,245 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:51,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:51,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020374262] [2021-11-06 10:30:51,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020374262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:51,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:51,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:30:51,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106406405] [2021-11-06 10:30:51,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:30:51,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:30:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:30:51,246 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:51,914 INFO L93 Difference]: Finished difference Result 329 states and 376 transitions. [2021-11-06 10:30:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:30:51,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-06 10:30:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:51,915 INFO L225 Difference]: With dead ends: 329 [2021-11-06 10:30:51,915 INFO L226 Difference]: Without dead ends: 208 [2021-11-06 10:30:51,916 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:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-06 10:30:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 152. [2021-11-06 10:30:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2021-11-06 10:30:51,920 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 40 [2021-11-06 10:30:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:51,920 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2021-11-06 10:30:51,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2021-11-06 10:30:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:30:51,921 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:51,921 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] [2021-11-06 10:30:51,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:30:51,921 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash -139950484, now seen corresponding path program 1 times [2021-11-06 10:30:51,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:51,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744269588] [2021-11-06 10:30:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:51,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:52,364 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:52,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:52,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744269588] [2021-11-06 10:30:52,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744269588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:52,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:52,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:30:52,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653005287] [2021-11-06 10:30:52,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:30:52,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:30:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:30:52,365 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:55,068 INFO L93 Difference]: Finished difference Result 317 states and 363 transitions. [2021-11-06 10:30:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:30:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:30:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:55,070 INFO L225 Difference]: With dead ends: 317 [2021-11-06 10:30:55,070 INFO L226 Difference]: Without dead ends: 200 [2021-11-06 10:30:55,070 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:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-06 10:30:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2021-11-06 10:30:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 151 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2021-11-06 10:30:55,074 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 42 [2021-11-06 10:30:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:55,075 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2021-11-06 10:30:55,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2021-11-06 10:30:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:30:55,090 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:55,090 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] [2021-11-06 10:30:55,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:30:55,090 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:30:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash 561649390, now seen corresponding path program 1 times [2021-11-06 10:30:55,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:55,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944188092] [2021-11-06 10:30:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:55,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:56,089 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,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:56,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944188092] [2021-11-06 10:30:56,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944188092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:56,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:56,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:30:56,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777821204] [2021-11-06 10:30:56,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:30:56,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:56,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:30:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:30:56,092 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:16,538 INFO L93 Difference]: Finished difference Result 347 states and 392 transitions. [2021-11-06 10:31:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:31:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:31:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:16,539 INFO L225 Difference]: With dead ends: 347 [2021-11-06 10:31:16,539 INFO L226 Difference]: Without dead ends: 265 [2021-11-06 10:31:16,540 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2021-11-06 10:31:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-06 10:31:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 159. [2021-11-06 10:31:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 149 states have (on average 1.2147651006711409) internal successors, (181), 158 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2021-11-06 10:31:16,544 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 42 [2021-11-06 10:31:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:16,544 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2021-11-06 10:31:16,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2021-11-06 10:31:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:31:16,545 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:16,545 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] [2021-11-06 10:31:16,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:31:16,545 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:31:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1036273874, now seen corresponding path program 1 times [2021-11-06 10:31:16,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:16,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944933061] [2021-11-06 10:31:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:16,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:31:17,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:17,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944933061] [2021-11-06 10:31:17,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944933061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:17,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:17,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:31:17,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025767857] [2021-11-06 10:31:17,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:31:17,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:31:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:31:17,162 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:24,664 INFO L93 Difference]: Finished difference Result 276 states and 314 transitions. [2021-11-06 10:31:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:31:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:31:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:24,666 INFO L225 Difference]: With dead ends: 276 [2021-11-06 10:31:24,666 INFO L226 Difference]: Without dead ends: 176 [2021-11-06 10:31:24,666 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:31:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-06 10:31:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2021-11-06 10:31:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 152 states have (on average 1.2105263157894737) internal successors, (184), 161 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:31:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 184 transitions. [2021-11-06 10:31:24,671 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 184 transitions. Word has length 42 [2021-11-06 10:31:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:24,671 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 184 transitions. [2021-11-06 10:31:24,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 184 transitions. [2021-11-06 10:31:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 10:31:24,671 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:24,671 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] [2021-11-06 10:31:24,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:31:24,672 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:31:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1560368280, now seen corresponding path program 1 times [2021-11-06 10:31:24,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:24,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759050365] [2021-11-06 10:31:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:24,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:24,885 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,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:24,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759050365] [2021-11-06 10:31:24,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759050365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:24,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:24,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:31:24,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853675045] [2021-11-06 10:31:24,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:31:24,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:31:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:31:24,886 INFO L87 Difference]: Start difference. First operand 162 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:29,699 INFO L93 Difference]: Finished difference Result 256 states and 288 transitions. [2021-11-06 10:31:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:31:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 10:31:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:29,701 INFO L225 Difference]: With dead ends: 256 [2021-11-06 10:31:29,701 INFO L226 Difference]: Without dead ends: 193 [2021-11-06 10:31:29,702 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:31:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-06 10:31:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2021-11-06 10:31:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 175 states have (on average 1.2057142857142857) internal successors, (211), 184 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2021-11-06 10:31:29,718 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 43 [2021-11-06 10:31:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:29,718 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2021-11-06 10:31:29,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2021-11-06 10:31:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 10:31:29,723 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:29,723 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] [2021-11-06 10:31:29,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:31:29,724 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:31:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1955314904, now seen corresponding path program 1 times [2021-11-06 10:31:29,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:29,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860033270] [2021-11-06 10:31:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:29,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:31:31,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:31,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860033270] [2021-11-06 10:31:31,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860033270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:31,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:31,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:31:31,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577268266] [2021-11-06 10:31:31,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:31:31,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:31:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:31:31,295 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:54,967 INFO L93 Difference]: Finished difference Result 330 states and 366 transitions. [2021-11-06 10:31:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-06 10:31:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 10:31:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:54,968 INFO L225 Difference]: With dead ends: 330 [2021-11-06 10:31:54,969 INFO L226 Difference]: Without dead ends: 267 [2021-11-06 10:31:54,970 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=524, Invalid=2128, Unknown=0, NotChecked=0, Total=2652 [2021-11-06 10:31:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-11-06 10:31:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 182. [2021-11-06 10:31:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 181 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2021-11-06 10:31:54,974 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 43 [2021-11-06 10:31:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:54,975 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2021-11-06 10:31:54,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2021-11-06 10:31:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 10:31:54,975 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:54,975 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] [2021-11-06 10:31:54,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:31:54,975 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:31:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1723612779, now seen corresponding path program 1 times [2021-11-06 10:31:54,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:54,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988364481] [2021-11-06 10:31:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:54,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:55,154 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:55,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:55,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988364481] [2021-11-06 10:31:55,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988364481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:55,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:55,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:31:55,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379251628] [2021-11-06 10:31:55,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:31:55,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:55,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:31:55,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:31:55,156 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:55,259 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2021-11-06 10:31:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:31:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 10:31:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:55,260 INFO L225 Difference]: With dead ends: 218 [2021-11-06 10:31:55,260 INFO L226 Difference]: Without dead ends: 182 [2021-11-06 10:31:55,261 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:31:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-06 10:31:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-11-06 10:31:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 172 states have (on average 1.2034883720930232) internal successors, (207), 181 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2021-11-06 10:31:55,265 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 45 [2021-11-06 10:31:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:55,266 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2021-11-06 10:31:55,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2021-11-06 10:31:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 10:31:55,268 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:55,269 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] [2021-11-06 10:31:55,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:31:55,269 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:31:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 305433952, now seen corresponding path program 1 times [2021-11-06 10:31:55,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:55,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481065214] [2021-11-06 10:31:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:55,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:55,786 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:55,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:55,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481065214] [2021-11-06 10:31:55,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481065214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:55,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:55,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:31:55,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026825468] [2021-11-06 10:31:55,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:31:55,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:31:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:31:55,788 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:00,770 INFO L93 Difference]: Finished difference Result 484 states and 549 transitions. [2021-11-06 10:32:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:32:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 10:32:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:00,772 INFO L225 Difference]: With dead ends: 484 [2021-11-06 10:32:00,772 INFO L226 Difference]: Without dead ends: 344 [2021-11-06 10:32:00,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:32:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-11-06 10:32:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 198. [2021-11-06 10:32:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 188 states have (on average 1.196808510638298) internal successors, (225), 197 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2021-11-06 10:32:00,778 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 45 [2021-11-06 10:32:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:00,778 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2021-11-06 10:32:00,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2021-11-06 10:32:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:32:00,779 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:00,779 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] [2021-11-06 10:32:00,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:32:00,783 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1864309569, now seen corresponding path program 1 times [2021-11-06 10:32:00,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:00,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958101540] [2021-11-06 10:32:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:00,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:03,538 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:03,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:03,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958101540] [2021-11-06 10:32:03,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958101540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:03,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:03,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:32:03,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912832659] [2021-11-06 10:32:03,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:32:03,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:32:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:32:03,539 INFO L87 Difference]: Start difference. First operand 198 states and 225 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:16,712 INFO L93 Difference]: Finished difference Result 420 states and 474 transitions. [2021-11-06 10:32:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:32:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:32:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:16,714 INFO L225 Difference]: With dead ends: 420 [2021-11-06 10:32:16,714 INFO L226 Difference]: Without dead ends: 235 [2021-11-06 10:32:16,715 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:32:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-06 10:32:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 194. [2021-11-06 10:32:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.1793478260869565) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-11-06 10:32:16,727 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 48 [2021-11-06 10:32:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:16,728 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-11-06 10:32:16,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-11-06 10:32:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:32:16,728 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:16,729 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] [2021-11-06 10:32:16,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:32:16,729 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -868262626, now seen corresponding path program 1 times [2021-11-06 10:32:16,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:16,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741609132] [2021-11-06 10:32:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:16,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:18,027 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:18,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:18,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741609132] [2021-11-06 10:32:18,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741609132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:18,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:18,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:32:18,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82581762] [2021-11-06 10:32:18,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:32:18,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:32:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:32:18,028 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:27,556 INFO L93 Difference]: Finished difference Result 410 states and 451 transitions. [2021-11-06 10:32:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:32:27,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:32:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:27,557 INFO L225 Difference]: With dead ends: 410 [2021-11-06 10:32:27,557 INFO L226 Difference]: Without dead ends: 322 [2021-11-06 10:32:27,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2021-11-06 10:32:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-11-06 10:32:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 197. [2021-11-06 10:32:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.1764705882352942) internal successors, (220), 196 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-06 10:32:27,564 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 48 [2021-11-06 10:32:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:27,564 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-06 10:32:27,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-06 10:32:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:32:27,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:27,564 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:32:27,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:32:27,565 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash 918000232, now seen corresponding path program 1 times [2021-11-06 10:32:27,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:27,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092197507] [2021-11-06 10:32:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:27,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:27,799 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:27,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:27,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092197507] [2021-11-06 10:32:27,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092197507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:27,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:27,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:32:27,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029498227] [2021-11-06 10:32:27,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:32:27,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:32:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:32:27,800 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:32,662 INFO L93 Difference]: Finished difference Result 297 states and 322 transitions. [2021-11-06 10:32:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:32:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:32:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:32,678 INFO L225 Difference]: With dead ends: 297 [2021-11-06 10:32:32,678 INFO L226 Difference]: Without dead ends: 252 [2021-11-06 10:32:32,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:32:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-06 10:32:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 215. [2021-11-06 10:32:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1609756097560975) internal successors, (238), 214 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 238 transitions. [2021-11-06 10:32:32,686 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 238 transitions. Word has length 51 [2021-11-06 10:32:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:32,687 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 238 transitions. [2021-11-06 10:32:32,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2021-11-06 10:32:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:32:32,688 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:32,688 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:32:32,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:32:32,689 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 746971928, now seen corresponding path program 1 times [2021-11-06 10:32:32,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:32,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044886752] [2021-11-06 10:32:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:32,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:33,086 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:33,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:33,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044886752] [2021-11-06 10:32:33,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044886752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:33,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:33,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:32:33,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351316595] [2021-11-06 10:32:33,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:32:33,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:33,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:32:33,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:32:33,088 INFO L87 Difference]: Start difference. First operand 215 states and 238 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:37,829 INFO L93 Difference]: Finished difference Result 252 states and 274 transitions. [2021-11-06 10:32:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:32:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:32:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:37,831 INFO L225 Difference]: With dead ends: 252 [2021-11-06 10:32:37,831 INFO L226 Difference]: Without dead ends: 250 [2021-11-06 10:32:37,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:32:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-06 10:32:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 223. [2021-11-06 10:32:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.164319248826291) internal successors, (248), 222 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 248 transitions. [2021-11-06 10:32:37,837 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 248 transitions. Word has length 51 [2021-11-06 10:32:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:37,837 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 248 transitions. [2021-11-06 10:32:37,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 248 transitions. [2021-11-06 10:32:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:32:37,838 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:37,838 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:32:37,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:32:37,838 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 747013634, now seen corresponding path program 1 times [2021-11-06 10:32:37,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:37,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140895739] [2021-11-06 10:32:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:37,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:37,970 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,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:37,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140895739] [2021-11-06 10:32:37,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140895739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:37,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:37,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 10:32:37,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263393103] [2021-11-06 10:32:37,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 10:32:37,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 10:32:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:32:37,972 INFO L87 Difference]: Start difference. First operand 223 states and 248 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:37,997 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2021-11-06 10:32:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 10:32:37,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:32:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:37,998 INFO L225 Difference]: With dead ends: 240 [2021-11-06 10:32:37,998 INFO L226 Difference]: Without dead ends: 225 [2021-11-06 10:32:37,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:32:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-06 10:32:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-11-06 10:32:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 215 states have (on average 1.1627906976744187) internal successors, (250), 224 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2021-11-06 10:32:38,004 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 51 [2021-11-06 10:32:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:38,004 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2021-11-06 10:32:38,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2021-11-06 10:32:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:32:38,005 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:38,005 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:32:38,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:32:38,005 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 747073216, now seen corresponding path program 1 times [2021-11-06 10:32:38,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:38,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904466123] [2021-11-06 10:32:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:38,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:32:39,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:39,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904466123] [2021-11-06 10:32:39,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904466123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:39,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:39,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:32:39,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847296749] [2021-11-06 10:32:39,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:32:39,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:39,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:32:39,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:32:39,107 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:55,797 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2021-11-06 10:32:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:32:55,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:32:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:55,798 INFO L225 Difference]: With dead ends: 294 [2021-11-06 10:32:55,798 INFO L226 Difference]: Without dead ends: 292 [2021-11-06 10:32:55,798 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:32:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-06 10:32:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2021-11-06 10:32:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 258 states have (on average 1.1511627906976745) internal successors, (297), 267 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 297 transitions. [2021-11-06 10:32:55,806 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 297 transitions. Word has length 51 [2021-11-06 10:32:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:55,806 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 297 transitions. [2021-11-06 10:32:55,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 297 transitions. [2021-11-06 10:32:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:32:55,807 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:55,807 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:32:55,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:32:55,807 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:32:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1794730536, now seen corresponding path program 1 times [2021-11-06 10:32:55,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:55,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449408998] [2021-11-06 10:32:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:55,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:32:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:32:56,418 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,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:32:56,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449408998] [2021-11-06 10:32:56,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449408998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:32:56,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:32:56,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:32:56,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747381612] [2021-11-06 10:32:56,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:32:56,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:32:56,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:32:56,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:32:56,420 INFO L87 Difference]: Start difference. First operand 268 states and 297 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:33:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:01,683 INFO L93 Difference]: Finished difference Result 356 states and 387 transitions. [2021-11-06 10:33:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:33:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:33:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:01,684 INFO L225 Difference]: With dead ends: 356 [2021-11-06 10:33:01,684 INFO L226 Difference]: Without dead ends: 310 [2021-11-06 10:33:01,685 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:33:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-06 10:33:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 272. [2021-11-06 10:33:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 262 states have (on average 1.1488549618320612) internal successors, (301), 271 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 301 transitions. [2021-11-06 10:33:01,692 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 301 transitions. Word has length 51 [2021-11-06 10:33:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:01,692 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 301 transitions. [2021-11-06 10:33:01,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:33:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 301 transitions. [2021-11-06 10:33:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:33:01,693 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:01,693 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:33:01,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:33:01,693 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:33:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1623702232, now seen corresponding path program 1 times [2021-11-06 10:33:01,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:01,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815865851] [2021-11-06 10:33:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:01,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:02,840 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:02,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:02,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815865851] [2021-11-06 10:33:02,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815865851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:02,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:02,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:33:02,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277706786] [2021-11-06 10:33:02,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:33:02,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:33:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:33:02,842 INFO L87 Difference]: Start difference. First operand 272 states and 301 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:33:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:18,319 INFO L93 Difference]: Finished difference Result 399 states and 431 transitions. [2021-11-06 10:33:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:33:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:33:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:18,321 INFO L225 Difference]: With dead ends: 399 [2021-11-06 10:33:18,321 INFO L226 Difference]: Without dead ends: 383 [2021-11-06 10:33:18,321 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:33:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-06 10:33:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 334. [2021-11-06 10:33:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.1203703703703705) internal successors, (363), 333 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 363 transitions. [2021-11-06 10:33:18,333 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 363 transitions. Word has length 51 [2021-11-06 10:33:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:18,333 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 363 transitions. [2021-11-06 10:33:18,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:33:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 363 transitions. [2021-11-06 10:33:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:33:18,334 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:18,334 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:33:18,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:33:18,334 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:33:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1623761814, now seen corresponding path program 1 times [2021-11-06 10:33:18,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:18,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784310166] [2021-11-06 10:33:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:18,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:20,426 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:20,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:20,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784310166] [2021-11-06 10:33:20,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784310166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:20,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:20,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-06 10:33:20,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269826163] [2021-11-06 10:33:20,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 10:33:20,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:20,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 10:33:20,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:33:20,429 INFO L87 Difference]: Start difference. First operand 334 states and 363 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:33:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:33:39,795 INFO L93 Difference]: Finished difference Result 408 states and 436 transitions. [2021-11-06 10:33:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-06 10:33:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:33:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:33:39,797 INFO L225 Difference]: With dead ends: 408 [2021-11-06 10:33:39,797 INFO L226 Difference]: Without dead ends: 395 [2021-11-06 10:33:39,798 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=289, Invalid=1271, Unknown=0, NotChecked=0, Total=1560 [2021-11-06 10:33:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-11-06 10:33:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 335. [2021-11-06 10:33:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 325 states have (on average 1.12) internal successors, (364), 334 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:33:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 364 transitions. [2021-11-06 10:33:39,809 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 364 transitions. Word has length 51 [2021-11-06 10:33:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:33:39,809 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 364 transitions. [2021-11-06 10:33:39,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:33:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 364 transitions. [2021-11-06 10:33:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:33:39,810 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:33:39,810 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:33:39,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:33:39,811 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:33:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:33:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1623803520, now seen corresponding path program 1 times [2021-11-06 10:33:39,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:33:39,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548496751] [2021-11-06 10:33:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:33:39,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:33:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:33:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:33:42,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:33:42,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548496751] [2021-11-06 10:33:42,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548496751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:33:42,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:33:42,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:33:42,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702021667] [2021-11-06 10:33:42,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:33:42,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:33:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:33:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:33:42,772 INFO L87 Difference]: Start difference. First operand 335 states and 364 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:34:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:04,187 INFO L93 Difference]: Finished difference Result 482 states and 525 transitions. [2021-11-06 10:34:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:34:04,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:34:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:04,189 INFO L225 Difference]: With dead ends: 482 [2021-11-06 10:34:04,189 INFO L226 Difference]: Without dead ends: 480 [2021-11-06 10:34:04,189 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:34:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-06 10:34:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 413. [2021-11-06 10:34:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 403 states have (on average 1.1364764267990075) internal successors, (458), 412 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 458 transitions. [2021-11-06 10:34:04,210 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 458 transitions. Word has length 51 [2021-11-06 10:34:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:04,210 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 458 transitions. [2021-11-06 10:34:04,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:34:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 458 transitions. [2021-11-06 10:34:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 10:34:04,211 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:04,211 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:34:04,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:34:04,212 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:34:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2130308031, now seen corresponding path program 1 times [2021-11-06 10:34:04,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:04,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496804753] [2021-11-06 10:34:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:04,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:04,846 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:04,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:04,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496804753] [2021-11-06 10:34:04,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496804753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:04,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:04,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:34:04,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549762103] [2021-11-06 10:34:04,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:34:04,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:34:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:34:04,847 INFO L87 Difference]: Start difference. First operand 413 states and 458 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:34:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:15,302 INFO L93 Difference]: Finished difference Result 540 states and 584 transitions. [2021-11-06 10:34:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:34:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 10:34:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:15,304 INFO L225 Difference]: With dead ends: 540 [2021-11-06 10:34:15,304 INFO L226 Difference]: Without dead ends: 383 [2021-11-06 10:34:15,304 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:34:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-06 10:34:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 332. [2021-11-06 10:34:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 322 states have (on average 1.1180124223602483) internal successors, (360), 331 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 360 transitions. [2021-11-06 10:34:15,315 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 360 transitions. Word has length 51 [2021-11-06 10:34:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:15,315 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 360 transitions. [2021-11-06 10:34:15,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:34:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 360 transitions. [2021-11-06 10:34:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:34:15,316 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:15,316 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:34:15,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:34:15,316 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:34:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 580617946, now seen corresponding path program 1 times [2021-11-06 10:34:15,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:15,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814550411] [2021-11-06 10:34:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:15,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:34:15,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:15,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814550411] [2021-11-06 10:34:15,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814550411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:15,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:15,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:34:15,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230929347] [2021-11-06 10:34:15,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:34:15,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:34:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:34:15,548 INFO L87 Difference]: Start difference. First operand 332 states and 360 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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:34:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:20,312 INFO L93 Difference]: Finished difference Result 360 states and 385 transitions. [2021-11-06 10:34:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:34:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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:34:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:20,313 INFO L225 Difference]: With dead ends: 360 [2021-11-06 10:34:20,313 INFO L226 Difference]: Without dead ends: 358 [2021-11-06 10:34:20,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:34:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-06 10:34:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 334. [2021-11-06 10:34:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.117283950617284) internal successors, (362), 333 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 362 transitions. [2021-11-06 10:34:20,325 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 362 transitions. Word has length 53 [2021-11-06 10:34:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:20,325 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 362 transitions. [2021-11-06 10:34:20,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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:34:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 362 transitions. [2021-11-06 10:34:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:34:20,326 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:20,327 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:34:20,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:34:20,327 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:34:20,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 677957058, now seen corresponding path program 1 times [2021-11-06 10:34:20,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:20,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618008025] [2021-11-06 10:34:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:20,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:20,943 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:20,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:20,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618008025] [2021-11-06 10:34:20,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618008025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:20,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:20,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:34:20,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696127924] [2021-11-06 10:34:20,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:34:20,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:34:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:34:20,944 INFO L87 Difference]: Start difference. First operand 334 states and 362 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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:34:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:28,458 INFO L93 Difference]: Finished difference Result 396 states and 424 transitions. [2021-11-06 10:34:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:34:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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:34:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:28,459 INFO L225 Difference]: With dead ends: 396 [2021-11-06 10:34:28,459 INFO L226 Difference]: Without dead ends: 369 [2021-11-06 10:34:28,460 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:34:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-06 10:34:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 334. [2021-11-06 10:34:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.1141975308641976) internal successors, (361), 333 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 361 transitions. [2021-11-06 10:34:28,472 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 361 transitions. Word has length 53 [2021-11-06 10:34:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:28,472 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 361 transitions. [2021-11-06 10:34:28,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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:34:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 361 transitions. [2021-11-06 10:34:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:34:28,473 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:28,473 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:34:28,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:34:28,474 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:34:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1379556932, now seen corresponding path program 1 times [2021-11-06 10:34:28,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:28,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933893013] [2021-11-06 10:34:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:28,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:29,701 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:29,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:29,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933893013] [2021-11-06 10:34:29,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933893013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:29,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:29,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:34:29,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924729334] [2021-11-06 10:34:29,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:34:29,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:34:29,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:34:29,703 INFO L87 Difference]: Start difference. First operand 334 states and 361 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:34:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:34:47,271 INFO L93 Difference]: Finished difference Result 360 states and 386 transitions. [2021-11-06 10:34:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:34:47,272 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:34:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:34:47,273 INFO L225 Difference]: With dead ends: 360 [2021-11-06 10:34:47,273 INFO L226 Difference]: Without dead ends: 344 [2021-11-06 10:34:47,273 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:34:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-11-06 10:34:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 293. [2021-11-06 10:34:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 283 states have (on average 1.1201413427561837) internal successors, (317), 292 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:34:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 317 transitions. [2021-11-06 10:34:47,291 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 317 transitions. Word has length 53 [2021-11-06 10:34:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:34:47,292 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 317 transitions. [2021-11-06 10:34:47,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:34:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 317 transitions. [2021-11-06 10:34:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:34:47,293 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:34:47,293 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:34:47,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:34:47,293 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:34:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:34:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1402189186, now seen corresponding path program 1 times [2021-11-06 10:34:47,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:34:47,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704553803] [2021-11-06 10:34:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:34:47,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:34:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:34:50,615 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:50,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:34:50,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704553803] [2021-11-06 10:34:50,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704553803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:34:50,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:34:50,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:34:50,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66479246] [2021-11-06 10:34:50,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:34:50,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:34:50,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:34:50,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:34:50,617 INFO L87 Difference]: Start difference. First operand 293 states and 317 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:35:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:01,142 INFO L93 Difference]: Finished difference Result 383 states and 407 transitions. [2021-11-06 10:35:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:35:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:35:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:01,143 INFO L225 Difference]: With dead ends: 383 [2021-11-06 10:35:01,143 INFO L226 Difference]: Without dead ends: 381 [2021-11-06 10:35:01,144 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:35:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-06 10:35:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 296. [2021-11-06 10:35:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 286 states have (on average 1.1223776223776223) internal successors, (321), 295 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2021-11-06 10:35:01,156 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 53 [2021-11-06 10:35:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:01,156 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2021-11-06 10:35:01,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:35:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2021-11-06 10:35:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 10:35:01,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:01,157 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] [2021-11-06 10:35:01,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:35:01,158 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:35:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash -928229713, now seen corresponding path program 1 times [2021-11-06 10:35:01,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:01,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759486825] [2021-11-06 10:35:01,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:01,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:35:05,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:05,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759486825] [2021-11-06 10:35:05,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759486825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:05,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:05,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:35:05,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895874685] [2021-11-06 10:35:05,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:35:05,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:35:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:35:05,398 INFO L87 Difference]: Start difference. First operand 296 states and 321 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:35:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:31,010 INFO L93 Difference]: Finished difference Result 548 states and 579 transitions. [2021-11-06 10:35:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-06 10:35:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 10:35:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:31,012 INFO L225 Difference]: With dead ends: 548 [2021-11-06 10:35:31,012 INFO L226 Difference]: Without dead ends: 432 [2021-11-06 10:35:31,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2021-11-06 10:35:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-11-06 10:35:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 296. [2021-11-06 10:35:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 286 states have (on average 1.1153846153846154) internal successors, (319), 295 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:35:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 319 transitions. [2021-11-06 10:35:31,026 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 319 transitions. Word has length 54 [2021-11-06 10:35:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:31,026 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 319 transitions. [2021-11-06 10:35:31,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:35:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 319 transitions. [2021-11-06 10:35:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 10:35:31,027 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:31,027 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] [2021-11-06 10:35:31,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:35:31,027 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:35:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -248171343, now seen corresponding path program 1 times [2021-11-06 10:35:31,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:31,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520440311] [2021-11-06 10:35:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:31,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:35:31,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:31,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520440311] [2021-11-06 10:35:31,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520440311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:31,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:31,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:35:31,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895726697] [2021-11-06 10:35:31,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:35:31,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:35:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:35:31,334 INFO L87 Difference]: Start difference. First operand 296 states and 319 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:35:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:35:33,856 INFO L93 Difference]: Finished difference Result 408 states and 441 transitions. [2021-11-06 10:35:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:35:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 10:35:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:35:33,857 INFO L225 Difference]: With dead ends: 408 [2021-11-06 10:35:33,857 INFO L226 Difference]: Without dead ends: 288 [2021-11-06 10:35:33,857 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:35:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-06 10:35:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-06 10:35:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 278 states have (on average 1.10431654676259) internal successors, (307), 287 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:35:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 307 transitions. [2021-11-06 10:35:33,870 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 307 transitions. Word has length 54 [2021-11-06 10:35:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:35:33,870 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 307 transitions. [2021-11-06 10:35:33,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:35:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 307 transitions. [2021-11-06 10:35:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 10:35:33,871 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:35:33,871 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] [2021-11-06 10:35:33,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:35:33,871 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:35:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:35:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1115787996, now seen corresponding path program 1 times [2021-11-06 10:35:33,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:35:33,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922728748] [2021-11-06 10:35:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:35:33,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:35:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:35:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:35:38,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:35:38,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922728748] [2021-11-06 10:35:38,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922728748] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:35:38,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:35:38,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:35:38,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691320285] [2021-11-06 10:35:38,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:35:38,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:35:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:35:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:35:38,293 INFO L87 Difference]: Start difference. First operand 288 states and 307 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:00,342 INFO L93 Difference]: Finished difference Result 390 states and 409 transitions. [2021-11-06 10:36:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:36:00,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 10:36:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:00,344 INFO L225 Difference]: With dead ends: 390 [2021-11-06 10:36:00,344 INFO L226 Difference]: Without dead ends: 388 [2021-11-06 10:36:00,347 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-11-06 10:36:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-06 10:36:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 334. [2021-11-06 10:36:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.095679012345679) internal successors, (355), 333 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 355 transitions. [2021-11-06 10:36:00,373 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 355 transitions. Word has length 55 [2021-11-06 10:36:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:00,374 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 355 transitions. [2021-11-06 10:36:00,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 355 transitions. [2021-11-06 10:36:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 10:36:00,374 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:00,375 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] [2021-11-06 10:36:00,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:36:00,375 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:36:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:00,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1758616887, now seen corresponding path program 1 times [2021-11-06 10:36:00,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:00,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355491411] [2021-11-06 10:36:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:00,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:36:01,451 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:01,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:36:01,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355491411] [2021-11-06 10:36:01,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355491411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:36:01,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:36:01,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:36:01,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632757071] [2021-11-06 10:36:01,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:36:01,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:36:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:36:01,454 INFO L87 Difference]: Start difference. First operand 334 states and 355 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:14,750 INFO L93 Difference]: Finished difference Result 473 states and 501 transitions. [2021-11-06 10:36:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:36:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 10:36:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:14,751 INFO L225 Difference]: With dead ends: 473 [2021-11-06 10:36:14,751 INFO L226 Difference]: Without dead ends: 351 [2021-11-06 10:36:14,752 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:36:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-11-06 10:36:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 320. [2021-11-06 10:36:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.0903225806451613) internal successors, (338), 319 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 338 transitions. [2021-11-06 10:36:14,784 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 338 transitions. Word has length 55 [2021-11-06 10:36:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:14,784 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 338 transitions. [2021-11-06 10:36:14,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 338 transitions. [2021-11-06 10:36:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 10:36:14,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:14,785 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] [2021-11-06 10:36:14,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:36:14,786 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:36:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1632186344, now seen corresponding path program 1 times [2021-11-06 10:36:14,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:14,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092801662] [2021-11-06 10:36:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:14,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:36:15,529 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:15,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:36:15,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092801662] [2021-11-06 10:36:15,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092801662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:36:15,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:36:15,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:36:15,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753527725] [2021-11-06 10:36:15,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:36:15,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:36:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:36:15,530 INFO L87 Difference]: Start difference. First operand 320 states and 338 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:24,368 INFO L93 Difference]: Finished difference Result 416 states and 436 transitions. [2021-11-06 10:36:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:36:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 10:36:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:24,370 INFO L225 Difference]: With dead ends: 416 [2021-11-06 10:36:24,370 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 10:36:24,370 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:36:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 10:36:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 316. [2021-11-06 10:36:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 307 states have (on average 1.0846905537459284) internal successors, (333), 315 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 333 transitions. [2021-11-06 10:36:24,383 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 333 transitions. Word has length 56 [2021-11-06 10:36:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:24,383 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 333 transitions. [2021-11-06 10:36:24,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 333 transitions. [2021-11-06 10:36:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 10:36:24,384 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:24,384 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:36:24,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:36:24,386 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:36:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -787246305, now seen corresponding path program 1 times [2021-11-06 10:36:24,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:24,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568210869] [2021-11-06 10:36:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:24,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:36:25,283 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:25,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:36:25,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568210869] [2021-11-06 10:36:25,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568210869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:36:25,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:36:25,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:36:25,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819393503] [2021-11-06 10:36:25,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:36:25,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:36:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:36:25,284 INFO L87 Difference]: Start difference. First operand 316 states and 333 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:37,007 INFO L93 Difference]: Finished difference Result 375 states and 391 transitions. [2021-11-06 10:36:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:36:37,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-06 10:36:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:37,008 INFO L225 Difference]: With dead ends: 375 [2021-11-06 10:36:37,008 INFO L226 Difference]: Without dead ends: 316 [2021-11-06 10:36:37,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:36:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-06 10:36:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-11-06 10:36:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 307 states have (on average 1.0781758957654723) internal successors, (331), 315 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 331 transitions. [2021-11-06 10:36:37,022 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 331 transitions. Word has length 57 [2021-11-06 10:36:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:37,023 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 331 transitions. [2021-11-06 10:36:37,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 331 transitions. [2021-11-06 10:36:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 10:36:37,023 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:37,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:36:37,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 10:36:37,024 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:36:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1469695334, now seen corresponding path program 1 times [2021-11-06 10:36:37,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:37,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24402928] [2021-11-06 10:36:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:37,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:36:40,299 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:40,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:36:40,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24402928] [2021-11-06 10:36:40,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24402928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:36:40,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:36:40,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:36:40,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053574451] [2021-11-06 10:36:40,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:36:40,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:36:40,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:36:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:36:40,300 INFO L87 Difference]: Start difference. First operand 316 states and 331 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:36:55,109 INFO L93 Difference]: Finished difference Result 336 states and 349 transitions. [2021-11-06 10:36:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:36:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-06 10:36:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:36:55,111 INFO L225 Difference]: With dead ends: 336 [2021-11-06 10:36:55,111 INFO L226 Difference]: Without dead ends: 282 [2021-11-06 10:36:55,111 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:36:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-06 10:36:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 270. [2021-11-06 10:36:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 261 states have (on average 1.0881226053639848) internal successors, (284), 269 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 284 transitions. [2021-11-06 10:36:55,151 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 284 transitions. Word has length 57 [2021-11-06 10:36:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:36:55,151 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 284 transitions. [2021-11-06 10:36:55,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:36:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 284 transitions. [2021-11-06 10:36:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 10:36:55,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:36:55,152 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] [2021-11-06 10:36:55,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 10:36:55,153 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:36:55,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:36:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1632577378, now seen corresponding path program 1 times [2021-11-06 10:36:55,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:36:55,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962373609] [2021-11-06 10:36:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:36:55,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:36:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:00,090 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:00,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:00,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962373609] [2021-11-06 10:37:00,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962373609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:00,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:00,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:37:00,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378747481] [2021-11-06 10:37:00,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:37:00,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:00,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:37:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:37:00,091 INFO L87 Difference]: Start difference. First operand 270 states and 284 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:37:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:24,100 INFO L93 Difference]: Finished difference Result 272 states and 285 transitions. [2021-11-06 10:37:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:37:24,101 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 10:37:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:24,101 INFO L225 Difference]: With dead ends: 272 [2021-11-06 10:37:24,101 INFO L226 Difference]: Without dead ends: 240 [2021-11-06 10:37:24,102 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:37:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-06 10:37:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-11-06 10:37:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 231 states have (on average 1.0952380952380953) internal successors, (253), 239 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 253 transitions. [2021-11-06 10:37:24,111 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 253 transitions. Word has length 58 [2021-11-06 10:37:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:24,111 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 253 transitions. [2021-11-06 10:37:24,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:37:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 253 transitions. [2021-11-06 10:37:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 10:37:24,112 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:24,112 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] [2021-11-06 10:37:24,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 10:37:24,112 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:37:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1013008931, now seen corresponding path program 1 times [2021-11-06 10:37:24,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:24,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116430055] [2021-11-06 10:37:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:24,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:25,775 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:25,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:25,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116430055] [2021-11-06 10:37:25,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116430055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:25,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:25,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:37:25,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970133646] [2021-11-06 10:37:25,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:37:25,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:37:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:37:25,777 INFO L87 Difference]: Start difference. First operand 240 states and 253 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:37:41,892 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2021-11-06 10:37:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:37:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-11-06 10:37:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:37:41,893 INFO L225 Difference]: With dead ends: 250 [2021-11-06 10:37:41,893 INFO L226 Difference]: Without dead ends: 175 [2021-11-06 10:37:41,894 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:37:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-06 10:37:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-06 10:37:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 166 states have (on average 1.1204819277108433) internal successors, (186), 174 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-11-06 10:37:41,900 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 60 [2021-11-06 10:37:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:37:41,900 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-11-06 10:37:41,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2021-11-06 10:37:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 10:37:41,901 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:37:41,901 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] [2021-11-06 10:37:41,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 10:37:41,901 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:37:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:37:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -857306152, now seen corresponding path program 1 times [2021-11-06 10:37:41,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:37:41,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597067921] [2021-11-06 10:37:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:37:41,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:37:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:37:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:37:45,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:37:45,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597067921] [2021-11-06 10:37:45,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597067921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:37:45,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:37:45,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:37:45,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369274723] [2021-11-06 10:37:45,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:37:45,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:37:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:37:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:37:45,157 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:38:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:38:00,824 INFO L93 Difference]: Finished difference Result 230 states and 243 transitions. [2021-11-06 10:38:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-06 10:38:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-11-06 10:38:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:38:00,826 INFO L225 Difference]: With dead ends: 230 [2021-11-06 10:38:00,826 INFO L226 Difference]: Without dead ends: 172 [2021-11-06 10:38:00,826 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2021-11-06 10:38:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-06 10:38:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2021-11-06 10:38:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 160 states have (on average 1.1125) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:38:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2021-11-06 10:38:00,832 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 61 [2021-11-06 10:38:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:38:00,833 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2021-11-06 10:38:00,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:38:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2021-11-06 10:38:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:38:00,833 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:38:00,833 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:38:00,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 10:38:00,834 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:38:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:38:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 171837296, now seen corresponding path program 1 times [2021-11-06 10:38:00,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:38:00,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791928518] [2021-11-06 10:38:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:38:00,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:38:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:38:02,119 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:38:02,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:38:02,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791928518] [2021-11-06 10:38:02,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791928518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:38:02,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:38:02,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:38:02,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673018383] [2021-11-06 10:38:02,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:38:02,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:38:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:38:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:38:02,121 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:38:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:38:14,666 INFO L93 Difference]: Finished difference Result 307 states and 317 transitions. [2021-11-06 10:38:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:38:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:38:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:38:14,667 INFO L225 Difference]: With dead ends: 307 [2021-11-06 10:38:14,667 INFO L226 Difference]: Without dead ends: 260 [2021-11-06 10:38:14,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:38:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-06 10:38:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 168. [2021-11-06 10:38:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 160 states have (on average 1.10625) internal successors, (177), 167 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:38:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2021-11-06 10:38:14,673 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 69 [2021-11-06 10:38:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:38:14,673 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2021-11-06 10:38:14,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:38:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2021-11-06 10:38:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:38:14,674 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:38:14,674 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:38:14,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 10:38:14,674 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:38:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:38:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1048466312, now seen corresponding path program 1 times [2021-11-06 10:38:14,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:38:14,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928925563] [2021-11-06 10:38:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:38:14,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:38:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:38:17,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:38:17,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:38:17,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928925563] [2021-11-06 10:38:17,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928925563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:38:17,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:38:17,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:38:17,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529801718] [2021-11-06 10:38:17,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:38:17,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:38:17,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:38:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:38:17,025 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 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:38:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:38:41,729 INFO L93 Difference]: Finished difference Result 284 states and 294 transitions. [2021-11-06 10:38:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 10:38:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 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:38:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:38:41,731 INFO L225 Difference]: With dead ends: 284 [2021-11-06 10:38:41,731 INFO L226 Difference]: Without dead ends: 242 [2021-11-06 10:38:41,732 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-11-06 10:38:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-06 10:38:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 175. [2021-11-06 10:38:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 167 states have (on average 1.1017964071856288) internal successors, (184), 174 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:38:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 184 transitions. [2021-11-06 10:38:41,739 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 184 transitions. Word has length 69 [2021-11-06 10:38:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:38:41,739 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 184 transitions. [2021-11-06 10:38:41,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 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:38:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 184 transitions. [2021-11-06 10:38:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:38:41,740 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:38:41,740 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:38:41,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-06 10:38:41,740 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:38:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:38:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash -235238369, now seen corresponding path program 1 times [2021-11-06 10:38:41,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:38:41,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100034444] [2021-11-06 10:38:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:38:41,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:38:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:38:44,240 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:38:44,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:38:44,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100034444] [2021-11-06 10:38:44,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100034444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:38:44,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:38:44,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:38:44,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497919083] [2021-11-06 10:38:44,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:38:44,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:38:44,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:38:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:38:44,241 INFO L87 Difference]: Start difference. First operand 175 states and 184 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:39:02,751 INFO L93 Difference]: Finished difference Result 240 states and 248 transitions. [2021-11-06 10:39:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:39:02,752 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:39:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:39:02,752 INFO L225 Difference]: With dead ends: 240 [2021-11-06 10:39:02,753 INFO L226 Difference]: Without dead ends: 238 [2021-11-06 10:39:02,753 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:39:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-06 10:39:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 207. [2021-11-06 10:39:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.0954773869346734) internal successors, (218), 206 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 218 transitions. [2021-11-06 10:39:02,761 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 218 transitions. Word has length 75 [2021-11-06 10:39:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:39:02,761 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 218 transitions. [2021-11-06 10:39:02,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 218 transitions. [2021-11-06 10:39:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:39:02,761 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:39:02,761 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:39:02,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-06 10:39:02,762 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:39:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:39:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1079243871, now seen corresponding path program 1 times [2021-11-06 10:39:02,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:39:02,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834238138] [2021-11-06 10:39:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:39:02,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:39:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:39:04,711 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:39:04,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:39:04,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834238138] [2021-11-06 10:39:04,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834238138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:39:04,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:39:04,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:39:04,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977118552] [2021-11-06 10:39:04,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:39:04,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:39:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:39:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:39:04,712 INFO L87 Difference]: Start difference. First operand 207 states and 218 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:39:23,573 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2021-11-06 10:39:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:39:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:39:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:39:23,575 INFO L225 Difference]: With dead ends: 231 [2021-11-06 10:39:23,575 INFO L226 Difference]: Without dead ends: 216 [2021-11-06 10:39:23,575 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:39:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-06 10:39:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 205. [2021-11-06 10:39:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 197 states have (on average 1.0862944162436547) internal successors, (214), 204 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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:39:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 214 transitions. [2021-11-06 10:39:23,584 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 214 transitions. Word has length 75 [2021-11-06 10:39:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:39:23,584 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 214 transitions. [2021-11-06 10:39:23,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 214 transitions. [2021-11-06 10:39:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:39:23,585 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:39:23,585 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:39:23,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-06 10:39:23,585 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:39:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:39:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash 838259593, now seen corresponding path program 1 times [2021-11-06 10:39:23,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:39:23,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690536035] [2021-11-06 10:39:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:39:23,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:39:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:39:27,811 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:39:27,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:39:27,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690536035] [2021-11-06 10:39:27,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690536035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:39:27,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:39:27,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:39:27,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197998864] [2021-11-06 10:39:27,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:39:27,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:39:27,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:39:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:39:27,812 INFO L87 Difference]: Start difference. First operand 205 states and 214 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:39:45,951 INFO L93 Difference]: Finished difference Result 251 states and 258 transitions. [2021-11-06 10:39:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-06 10:39:45,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:39:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:39:45,953 INFO L225 Difference]: With dead ends: 251 [2021-11-06 10:39:45,953 INFO L226 Difference]: Without dead ends: 214 [2021-11-06 10:39:45,954 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2021-11-06 10:39:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-06 10:39:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2021-11-06 10:39:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 191 states have (on average 1.0785340314136125) internal successors, (206), 197 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:39:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2021-11-06 10:39:45,963 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 75 [2021-11-06 10:39:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:39:45,963 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2021-11-06 10:39:45,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2021-11-06 10:39:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:39:45,968 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:39:45,968 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:39:45,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-06 10:39:45,968 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:39:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:39:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 667231289, now seen corresponding path program 1 times [2021-11-06 10:39:45,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:39:45,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177318125] [2021-11-06 10:39:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:39:45,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:39:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:39:46,890 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:39:46,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:39:46,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177318125] [2021-11-06 10:39:46,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177318125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:39:46,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:39:46,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:39:46,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911213660] [2021-11-06 10:39:46,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:39:46,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:39:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:39:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:39:46,892 INFO L87 Difference]: Start difference. First operand 198 states and 206 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:39:56,891 INFO L93 Difference]: Finished difference Result 266 states and 274 transitions. [2021-11-06 10:39:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:39:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:39:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:39:56,893 INFO L225 Difference]: With dead ends: 266 [2021-11-06 10:39:56,893 INFO L226 Difference]: Without dead ends: 232 [2021-11-06 10:39:56,893 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:39:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-06 10:39:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 198. [2021-11-06 10:39:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 191 states have (on average 1.0732984293193717) internal successors, (205), 197 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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:39:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 205 transitions. [2021-11-06 10:39:56,901 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 205 transitions. Word has length 75 [2021-11-06 10:39:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:39:56,902 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 205 transitions. [2021-11-06 10:39:56,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:39:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 205 transitions. [2021-11-06 10:39:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:39:56,902 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:39:56,902 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:39:56,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-06 10:39:56,903 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:39:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:39:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash 971638839, now seen corresponding path program 1 times [2021-11-06 10:39:56,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:39:56,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213147525] [2021-11-06 10:39:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:39:56,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:39:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:39:58,937 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:39:58,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:39:58,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213147525] [2021-11-06 10:39:58,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213147525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:39:58,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:39:58,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:39:58,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282691064] [2021-11-06 10:39:58,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:39:58,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:39:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:39:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:39:58,938 INFO L87 Difference]: Start difference. First operand 198 states and 205 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:40:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:40:20,463 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2021-11-06 10:40:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:40:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:40:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:40:20,465 INFO L225 Difference]: With dead ends: 233 [2021-11-06 10:40:20,465 INFO L226 Difference]: Without dead ends: 215 [2021-11-06 10:40:20,465 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:40:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-06 10:40:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2021-11-06 10:40:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 190 states have (on average 1.063157894736842) internal successors, (202), 196 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:40:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 202 transitions. [2021-11-06 10:40:20,473 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 202 transitions. Word has length 75 [2021-11-06 10:40:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:40:20,474 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 202 transitions. [2021-11-06 10:40:20,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:40:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 202 transitions. [2021-11-06 10:40:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:40:20,474 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:40:20,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:40:20,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-06 10:40:20,475 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:40:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:40:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 971698421, now seen corresponding path program 1 times [2021-11-06 10:40:20,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:40:20,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237333815] [2021-11-06 10:40:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:40:20,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:40:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:40:21,930 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:40:21,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:40:21,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237333815] [2021-11-06 10:40:21,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237333815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:40:21,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:40:21,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:40:21,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359725730] [2021-11-06 10:40:21,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:40:21,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:40:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:40:21,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:40:21,932 INFO L87 Difference]: Start difference. First operand 197 states and 202 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:40:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:40:37,768 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2021-11-06 10:40:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 10:40:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:40:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:40:37,769 INFO L225 Difference]: With dead ends: 248 [2021-11-06 10:40:37,769 INFO L226 Difference]: Without dead ends: 235 [2021-11-06 10:40:37,769 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:40:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-06 10:40:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 204. [2021-11-06 10:40:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 197 states have (on average 1.0609137055837563) internal successors, (209), 203 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:40:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 209 transitions. [2021-11-06 10:40:37,778 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 209 transitions. Word has length 75 [2021-11-06 10:40:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:40:37,778 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 209 transitions. [2021-11-06 10:40:37,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:40:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 209 transitions. [2021-11-06 10:40:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:40:37,779 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:40:37,779 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:40:37,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-06 10:40:37,779 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:40:37,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:40:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash 971740127, now seen corresponding path program 1 times [2021-11-06 10:40:37,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:40:37,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845239757] [2021-11-06 10:40:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:40:37,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:40:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:40:41,928 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:40:41,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:40:41,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845239757] [2021-11-06 10:40:41,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845239757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:40:41,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:40:41,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:40:41,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075176697] [2021-11-06 10:40:41,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:40:41,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:40:41,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:40:41,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:40:41,930 INFO L87 Difference]: Start difference. First operand 204 states and 209 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:41:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:41:01,578 INFO L93 Difference]: Finished difference Result 218 states and 221 transitions. [2021-11-06 10:41:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:41:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 10:41:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:41:01,579 INFO L225 Difference]: With dead ends: 218 [2021-11-06 10:41:01,579 INFO L226 Difference]: Without dead ends: 216 [2021-11-06 10:41:01,580 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:41:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-06 10:41:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2021-11-06 10:41:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.0561224489795917) internal successors, (207), 201 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:41:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 207 transitions. [2021-11-06 10:41:01,589 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 207 transitions. Word has length 75 [2021-11-06 10:41:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:41:01,590 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 207 transitions. [2021-11-06 10:41:01,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:41:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 207 transitions. [2021-11-06 10:41:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 10:41:01,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:41:01,591 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:41:01,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-06 10:41:01,591 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:41:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:41:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1569328993, now seen corresponding path program 1 times [2021-11-06 10:41:01,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:41:01,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035238865] [2021-11-06 10:41:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:41:01,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:41:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:41:02,600 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:41:02,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:41:02,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035238865] [2021-11-06 10:41:02,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035238865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:41:02,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:41:02,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:41:02,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577498526] [2021-11-06 10:41:02,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:41:02,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:41:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:41:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:41:02,602 INFO L87 Difference]: Start difference. First operand 202 states and 207 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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:41:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:41:18,998 INFO L93 Difference]: Finished difference Result 216 states and 219 transitions. [2021-11-06 10:41:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:41:18,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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:41:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:41:18,999 INFO L225 Difference]: With dead ends: 216 [2021-11-06 10:41:19,000 INFO L226 Difference]: Without dead ends: 203 [2021-11-06 10:41:19,000 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:41:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-06 10:41:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 196. [2021-11-06 10:41:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.0471204188481675) internal successors, (200), 195 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:41:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2021-11-06 10:41:19,013 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 77 [2021-11-06 10:41:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:41:19,014 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2021-11-06 10:41:19,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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:41:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2021-11-06 10:41:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 10:41:19,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:41:19,014 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:41:19,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-06 10:41:19,015 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:41:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:41:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2012017411, now seen corresponding path program 1 times [2021-11-06 10:41:19,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:41:19,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195121178] [2021-11-06 10:41:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:41:19,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:41:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:41:27,035 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:41:27,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:41:27,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195121178] [2021-11-06 10:41:27,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195121178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:41:27,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:41:27,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-11-06 10:41:27,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830905039] [2021-11-06 10:41:27,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-06 10:41:27,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:41:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-06 10:41:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:41:27,036 INFO L87 Difference]: Start difference. First operand 196 states and 200 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:42:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:42:12,174 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2021-11-06 10:42:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-06 10:42:12,174 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 10:42:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:42:12,175 INFO L225 Difference]: With dead ends: 223 [2021-11-06 10:42:12,175 INFO L226 Difference]: Without dead ends: 221 [2021-11-06 10:42:12,175 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=588, Invalid=2834, Unknown=0, NotChecked=0, Total=3422 [2021-11-06 10:42:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-06 10:42:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-11-06 10:42:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0459183673469388) internal successors, (205), 200 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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:42:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2021-11-06 10:42:12,188 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 79 [2021-11-06 10:42:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:42:12,188 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2021-11-06 10:42:12,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:42:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2021-11-06 10:42:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:42:12,190 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:42:12,190 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:42:12,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-06 10:42:12,190 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:42:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:42:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash 711781694, now seen corresponding path program 1 times [2021-11-06 10:42:12,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:42:12,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638873665] [2021-11-06 10:42:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:42:12,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:42:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:42:23,357 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:42:23,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:42:23,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638873665] [2021-11-06 10:42:23,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638873665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:42:23,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:42:23,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:42:23,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594023373] [2021-11-06 10:42:23,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:42:23,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:42:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:42:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:42:23,359 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 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:42:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:42:49,634 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2021-11-06 10:42:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:42:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 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:42:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:42:49,635 INFO L225 Difference]: With dead ends: 207 [2021-11-06 10:42:49,635 INFO L226 Difference]: Without dead ends: 136 [2021-11-06 10:42:49,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2021-11-06 10:42:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-06 10:42:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-11-06 10:42:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 135 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:42:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2021-11-06 10:42:49,642 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 81 [2021-11-06 10:42:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:42:49,642 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2021-11-06 10:42:49,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 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:42:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2021-11-06 10:42:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:42:49,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:42:49,643 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:42:49,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-06 10:42:49,643 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:42:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:42:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1067345896, now seen corresponding path program 1 times [2021-11-06 10:42:49,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:42:49,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857906206] [2021-11-06 10:42:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:42:49,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:42:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:42:52,214 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:42:52,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:42:52,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857906206] [2021-11-06 10:42:52,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857906206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:42:52,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:42:52,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:42:52,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651275875] [2021-11-06 10:42:52,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:42:52,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:42:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:42:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:42:52,216 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 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:43:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:15,871 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2021-11-06 10:43:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:43:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 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:43:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:15,872 INFO L225 Difference]: With dead ends: 136 [2021-11-06 10:43:15,872 INFO L226 Difference]: Without dead ends: 123 [2021-11-06 10:43:15,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:43:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-06 10:43:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-11-06 10:43:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 121 states have (on average 1.024793388429752) internal successors, (124), 122 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:43:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-11-06 10:43:15,879 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 81 [2021-11-06 10:43:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:15,879 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-11-06 10:43:15,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 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:43:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-11-06 10:43:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:43:15,880 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:15,880 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:43:15,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-06 10:43:15,880 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:43:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 813584261, now seen corresponding path program 1 times [2021-11-06 10:43:15,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:15,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113878445] [2021-11-06 10:43:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:15,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:19,872 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:43:19,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:19,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113878445] [2021-11-06 10:43:19,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113878445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:19,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:19,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:43:19,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652183970] [2021-11-06 10:43:19,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:43:19,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:43:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:43:19,873 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 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:43:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:34,391 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2021-11-06 10:43:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:43:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 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:43:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:34,392 INFO L225 Difference]: With dead ends: 123 [2021-11-06 10:43:34,392 INFO L226 Difference]: Without dead ends: 99 [2021-11-06 10:43:34,392 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:43:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-06 10:43:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2021-11-06 10:43:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 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:43:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2021-11-06 10:43:34,397 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 81 [2021-11-06 10:43:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:34,397 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2021-11-06 10:43:34,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 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:43:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2021-11-06 10:43:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:43:34,397 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:34,397 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:43:34,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-06 10:43:34,397 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-06 10:43:34,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash -128599946, now seen corresponding path program 1 times [2021-11-06 10:43:34,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:34,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850815682] [2021-11-06 10:43:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:34,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:42,670 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:43:42,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:42,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850815682] [2021-11-06 10:43:42,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850815682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:42,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:42,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-06 10:43:42,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561288497] [2021-11-06 10:43:42,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-06 10:43:42,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:42,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-06 10:43:42,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:43:42,671 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:12,686 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2021-11-06 10:44:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:44:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-06 10:44:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:12,687 INFO L225 Difference]: With dead ends: 92 [2021-11-06 10:44:12,687 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 10:44:12,688 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=196, Invalid=1286, Unknown=0, NotChecked=0, Total=1482 [2021-11-06 10:44:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 10:44:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 10:44:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 10:44:12,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2021-11-06 10:44:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:12,688 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 10:44:12,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 10:44:12,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 10:44:12,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:44:12,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-06 10:44:12,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 10:44:12,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:12,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:44:13,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms Killed by 15