./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_left_trim_pred_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:44:05,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:44:05,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:44:05,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:44:05,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:44:05,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:44:05,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:44:05,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:44:05,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:44:05,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:44:05,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:44:05,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:44:05,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:44:05,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:44:05,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:44:05,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:44:05,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:44:05,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:44:05,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:44:05,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:44:05,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:44:05,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:44:05,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:44:05,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:44:05,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:44:05,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:44:05,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:44:05,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:44:05,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:44:05,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:44:05,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:44:05,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:44:05,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:44:05,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:44:05,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:44:05,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:44:05,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:44:05,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:44:05,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:44:05,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:44:05,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:44:05,137 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:44:05,154 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:44:05,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:44:05,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:44:05,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:44:05,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:44:05,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:44:05,156 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:44:05,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:44:05,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:44:05,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:44:05,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:44:05,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:44:05,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:44:05,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:44:05,158 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:44:05,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:44:05,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:44:05,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:44:05,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:44:05,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:44:05,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:44:05,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:44:05,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:44:05,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:44:05,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:44:05,159 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:44:05,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:44:05,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:44:05,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:44:05,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 [2021-11-06 10:44:05,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:44:05,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:44:05,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:44:05,340 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:44:05,340 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:44:05,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-06 10:44:05,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cce638ee/2ba5099bd7ec43f5ad92140b761fb45d/FLAG151f39491 [2021-11-06 10:44:06,043 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:44:06,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-06 10:44:06,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cce638ee/2ba5099bd7ec43f5ad92140b761fb45d/FLAG151f39491 [2021-11-06 10:44:06,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cce638ee/2ba5099bd7ec43f5ad92140b761fb45d [2021-11-06 10:44:06,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:44:06,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:44:06,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:44:06,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:44:06,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:44:06,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:06" (1/1) ... [2021-11-06 10:44:06,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d58797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:06, skipping insertion in model container [2021-11-06 10:44:06,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:06" (1/1) ... [2021-11-06 10:44:06,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:44:06,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:44:06,717 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_left_trim_pred_harness.i[4504,4517] [2021-11-06 10:44:06,726 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_left_trim_pred_harness.i[4564,4577] [2021-11-06 10:44:06,737 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:44:06,740 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:44:07,198 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,208 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,209 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,213 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,214 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,415 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:44:07,416 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:44:07,417 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:44:07,419 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:44:07,423 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:44:07,425 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:44:07,425 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:44:07,426 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:44:07,427 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:44:07,428 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:44:07,552 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:44:07,635 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,635 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:44:07,741 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:44:07,757 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_left_trim_pred_harness.i[4504,4517] [2021-11-06 10:44:07,758 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_left_trim_pred_harness.i[4564,4577] [2021-11-06 10:44:07,759 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:44:07,760 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:44:07,786 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,787 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,787 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,787 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,789 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,792 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,793 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,793 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,793 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,817 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:44:07,817 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:44:07,818 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:44:07,818 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:44:07,819 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:44:07,819 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:44:07,819 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:44:07,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:44:07,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:44:07,822 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:44:07,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:44:07,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:44:07,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:44:08,076 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:44:08,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08 WrapperNode [2021-11-06 10:44:08,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:44:08,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:44:08,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:44:08,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:44:08,083 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:44:08" (1/1) ... [2021-11-06 10:44:08,166 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:44:08" (1/1) ... [2021-11-06 10:44:08,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:44:08,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:44:08,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:44:08,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:44:08,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:44:08,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:44:08,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:44:08,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:44:08,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (1/1) ... [2021-11-06 10:44:08,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:44:08,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:44:08,331 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:44:08,350 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:44:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:44:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:44:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:44:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:44:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:44:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:44:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:44:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:44:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:44:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:44:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:44:15,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:44:15,303 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-11-06 10:44:15,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:15 BoogieIcfgContainer [2021-11-06 10:44:15,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:44:15,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:44:15,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:44:15,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:44:15,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:44:06" (1/3) ... [2021-11-06 10:44:15,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f68204b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:15, skipping insertion in model container [2021-11-06 10:44:15,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:08" (2/3) ... [2021-11-06 10:44:15,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f68204b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:15, skipping insertion in model container [2021-11-06 10:44:15,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:15" (3/3) ... [2021-11-06 10:44:15,310 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_left_trim_pred_harness.i [2021-11-06 10:44:15,313 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:44:15,314 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-06 10:44:15,348 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:44:15,356 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:44:15,357 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-06 10:44:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 10:44:15,382 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:15,382 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:44:15,383 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-06 10:44:15,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:15,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245309631] [2021-11-06 10:44:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:15,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:15,908 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:44:15,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:15,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245309631] [2021-11-06 10:44:15,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245309631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:15,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:15,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:44:15,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777526596] [2021-11-06 10:44:15,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:44:15,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:15,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:44:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:44:15,926 INFO L87 Difference]: Start difference. First operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:15,949 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2021-11-06 10:44:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:44:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-06 10:44:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:15,956 INFO L225 Difference]: With dead ends: 244 [2021-11-06 10:44:15,957 INFO L226 Difference]: Without dead ends: 117 [2021-11-06 10:44:15,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:44:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-06 10:44:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-06 10:44:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 116 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2021-11-06 10:44:15,993 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 30 [2021-11-06 10:44:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:15,993 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2021-11-06 10:44:15,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2021-11-06 10:44:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 10:44:15,997 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:15,999 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:44:15,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:44:16,000 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-06 10:44:16,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:16,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115281759] [2021-11-06 10:44:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:16,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:16,254 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:44:16,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:16,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115281759] [2021-11-06 10:44:16,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115281759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:16,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:16,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:44:16,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719224491] [2021-11-06 10:44:16,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:44:16,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:16,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:44:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:44:16,256 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:16,421 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2021-11-06 10:44:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:44:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-06 10:44:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:16,422 INFO L225 Difference]: With dead ends: 213 [2021-11-06 10:44:16,422 INFO L226 Difference]: Without dead ends: 117 [2021-11-06 10:44:16,423 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:44:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-06 10:44:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-06 10:44:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3125) internal successors, (147), 116 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-11-06 10:44:16,428 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 32 [2021-11-06 10:44:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:16,428 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-11-06 10:44:16,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-11-06 10:44:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:44:16,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:16,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:44:16,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:44:16,430 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-06 10:44:16,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:16,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171539169] [2021-11-06 10:44:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:16,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:16,740 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:44:16,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:16,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171539169] [2021-11-06 10:44:16,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171539169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:16,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:16,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:44:16,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038703429] [2021-11-06 10:44:16,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:44:16,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:16,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:44:16,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:44:16,742 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:44:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:16,976 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2021-11-06 10:44:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:44:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:44:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:16,978 INFO L225 Difference]: With dead ends: 174 [2021-11-06 10:44:16,978 INFO L226 Difference]: Without dead ends: 117 [2021-11-06 10:44:16,978 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:44:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-06 10:44:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-06 10:44:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-11-06 10:44:16,983 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 36 [2021-11-06 10:44:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:16,983 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-11-06 10:44:16,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:44:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-11-06 10:44:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 10:44:16,984 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:16,984 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] [2021-11-06 10:44:16,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:44:16,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-06 10:44:16,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:16,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599639320] [2021-11-06 10:44:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:16,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:17,422 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:44:17,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:17,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599639320] [2021-11-06 10:44:17,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599639320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:17,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:17,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:44:17,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468453577] [2021-11-06 10:44:17,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:44:17,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:17,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:44:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:44:17,424 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:18,137 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2021-11-06 10:44:18,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:44:18,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 10:44:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:18,139 INFO L225 Difference]: With dead ends: 216 [2021-11-06 10:44:18,139 INFO L226 Difference]: Without dead ends: 208 [2021-11-06 10:44:18,139 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:44:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-06 10:44:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2021-11-06 10:44:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.265625) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-11-06 10:44:18,146 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2021-11-06 10:44:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:18,146 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-11-06 10:44:18,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-11-06 10:44:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:44:18,147 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:18,147 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:44:18,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:44:18,147 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-06 10:44:18,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:18,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95925133] [2021-11-06 10:44:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:18,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:18,870 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:44:18,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:18,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95925133] [2021-11-06 10:44:18,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95925133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:18,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:18,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:44:18,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113654242] [2021-11-06 10:44:18,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:44:18,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:44:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:44:18,872 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:27,080 INFO L93 Difference]: Finished difference Result 399 states and 482 transitions. [2021-11-06 10:44:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:44:27,081 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:44:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:27,083 INFO L225 Difference]: With dead ends: 399 [2021-11-06 10:44:27,083 INFO L226 Difference]: Without dead ends: 292 [2021-11-06 10:44:27,083 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:44:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-06 10:44:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-06 10:44:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 206 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-11-06 10:44:27,093 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 42 [2021-11-06 10:44:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:27,094 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-11-06 10:44:27,094 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:44:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-11-06 10:44:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 10:44:27,095 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:27,095 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:44:27,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:44:27,095 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-06 10:44:27,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:27,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824308983] [2021-11-06 10:44:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:27,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:27,335 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:44:27,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:27,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824308983] [2021-11-06 10:44:27,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824308983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:27,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:27,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:44:27,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014519242] [2021-11-06 10:44:27,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:44:27,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:27,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:44:27,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:44:27,336 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:27,475 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-11-06 10:44:27,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:44:27,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 10:44:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:27,477 INFO L225 Difference]: With dead ends: 264 [2021-11-06 10:44:27,477 INFO L226 Difference]: Without dead ends: 207 [2021-11-06 10:44:27,477 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:44:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-06 10:44:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-06 10:44:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 206 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2021-11-06 10:44:27,484 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 43 [2021-11-06 10:44:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:27,485 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2021-11-06 10:44:27,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2021-11-06 10:44:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 10:44:27,486 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:27,486 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:44:27,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:44:27,486 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-06 10:44:27,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:27,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55051351] [2021-11-06 10:44:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:27,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:44:27,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:27,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55051351] [2021-11-06 10:44:27,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55051351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:27,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:27,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 10:44:27,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245981736] [2021-11-06 10:44:27,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 10:44:27,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 10:44:27,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:44:27,640 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:27,672 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2021-11-06 10:44:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 10:44:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 10:44:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:27,675 INFO L225 Difference]: With dead ends: 298 [2021-11-06 10:44:27,675 INFO L226 Difference]: Without dead ends: 210 [2021-11-06 10:44:27,676 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:44:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-06 10:44:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-06 10:44:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 209 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2021-11-06 10:44:27,686 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 45 [2021-11-06 10:44:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:27,686 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2021-11-06 10:44:27,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2021-11-06 10:44:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 10:44:27,687 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:27,687 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] [2021-11-06 10:44:27,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:44:27,688 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-06 10:44:27,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:27,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529574458] [2021-11-06 10:44:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:27,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:28,186 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:44:28,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:28,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529574458] [2021-11-06 10:44:28,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529574458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:28,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:28,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:44:28,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368894411] [2021-11-06 10:44:28,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:44:28,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:28,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:44:28,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:44:28,188 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:28,937 INFO L93 Difference]: Finished difference Result 433 states and 511 transitions. [2021-11-06 10:44:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:44:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 10:44:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:28,939 INFO L225 Difference]: With dead ends: 433 [2021-11-06 10:44:28,939 INFO L226 Difference]: Without dead ends: 262 [2021-11-06 10:44:28,940 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:44:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-06 10:44:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 210. [2021-11-06 10:44:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 209 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2021-11-06 10:44:28,951 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 46 [2021-11-06 10:44:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:28,952 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2021-11-06 10:44:28,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2021-11-06 10:44:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 10:44:28,952 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:28,953 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:44:28,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:44:28,953 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-06 10:44:28,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:28,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668413229] [2021-11-06 10:44:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:28,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 10:44:29,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:29,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668413229] [2021-11-06 10:44:29,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668413229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:29,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:29,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:44:29,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210011646] [2021-11-06 10:44:29,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:44:29,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:29,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:44:29,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:44:29,450 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:34,574 INFO L93 Difference]: Finished difference Result 408 states and 486 transitions. [2021-11-06 10:44:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:44:34,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 10:44:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:34,576 INFO L225 Difference]: With dead ends: 408 [2021-11-06 10:44:34,576 INFO L226 Difference]: Without dead ends: 272 [2021-11-06 10:44:34,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:44:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-06 10:44:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 204. [2021-11-06 10:44:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.2060301507537687) internal successors, (240), 203 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2021-11-06 10:44:34,583 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 47 [2021-11-06 10:44:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:34,583 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2021-11-06 10:44:34,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2021-11-06 10:44:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:44:34,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:34,584 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:44:34,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:44:34,585 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash 93394749, now seen corresponding path program 1 times [2021-11-06 10:44:34,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:34,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922839472] [2021-11-06 10:44:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:34,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:34,953 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:44:34,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:34,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922839472] [2021-11-06 10:44:34,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922839472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:34,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:34,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:44:34,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061888786] [2021-11-06 10:44:34,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:44:34,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:44:34,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:44:34,954 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:37,728 INFO L93 Difference]: Finished difference Result 394 states and 463 transitions. [2021-11-06 10:44:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:44:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:44:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:37,729 INFO L225 Difference]: With dead ends: 394 [2021-11-06 10:44:37,730 INFO L226 Difference]: Without dead ends: 230 [2021-11-06 10:44:37,730 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:44:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-06 10:44:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2021-11-06 10:44:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.1658291457286432) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call 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:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2021-11-06 10:44:37,735 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 48 [2021-11-06 10:44:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:37,736 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2021-11-06 10:44:37,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2021-11-06 10:44:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:44:37,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:37,736 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:44:37,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:44:37,737 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2144378747, now seen corresponding path program 1 times [2021-11-06 10:44:37,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:37,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265303067] [2021-11-06 10:44:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:37,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:38,270 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:44:38,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:38,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265303067] [2021-11-06 10:44:38,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265303067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:38,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:38,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:44:38,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080445311] [2021-11-06 10:44:38,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:44:38,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:44:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:44:38,272 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:48,061 INFO L93 Difference]: Finished difference Result 536 states and 610 transitions. [2021-11-06 10:44:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:44:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:44:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:48,063 INFO L225 Difference]: With dead ends: 536 [2021-11-06 10:44:48,063 INFO L226 Difference]: Without dead ends: 472 [2021-11-06 10:44:48,064 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:44:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-06 10:44:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 181. [2021-11-06 10:44:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.1647727272727273) internal successors, (205), 180 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:44:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2021-11-06 10:44:48,069 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 48 [2021-11-06 10:44:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:48,069 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2021-11-06 10:44:48,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2021-11-06 10:44:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 10:44:48,070 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:48,070 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] [2021-11-06 10:44:48,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:44:48,070 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-06 10:44:48,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:48,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074171] [2021-11-06 10:44:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:48,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:44:48,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:48,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074171] [2021-11-06 10:44:48,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074171] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:48,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:48,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:44:48,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140693006] [2021-11-06 10:44:48,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:44:48,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:44:48,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:44:48,361 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:51,022 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2021-11-06 10:44:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:44:51,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 10:44:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:51,024 INFO L225 Difference]: With dead ends: 338 [2021-11-06 10:44:51,024 INFO L226 Difference]: Without dead ends: 181 [2021-11-06 10:44:51,024 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:44:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-06 10:44:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-06 10:44:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.125) internal successors, (198), 180 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call 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:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2021-11-06 10:44:51,029 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 49 [2021-11-06 10:44:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:51,030 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2021-11-06 10:44:51,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:44:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2021-11-06 10:44:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 10:44:51,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:51,030 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] [2021-11-06 10:44:51,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:44:51,031 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:44:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash 190279064, now seen corresponding path program 1 times [2021-11-06 10:44:51,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:51,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627593496] [2021-11-06 10:44:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:51,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:51,739 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:44:51,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:51,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627593496] [2021-11-06 10:44:51,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627593496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:51,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:51,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:44:51,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522421506] [2021-11-06 10:44:51,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:44:51,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:44:51,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:44:51,741 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:02,354 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2021-11-06 10:45:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:45:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 10:45:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:02,356 INFO L225 Difference]: With dead ends: 310 [2021-11-06 10:45:02,356 INFO L226 Difference]: Without dead ends: 265 [2021-11-06 10:45:02,356 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:45:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-06 10:45:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 201. [2021-11-06 10:45:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.1122448979591837) internal successors, (218), 200 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2021-11-06 10:45:02,362 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 49 [2021-11-06 10:45:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:02,362 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2021-11-06 10:45:02,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2021-11-06 10:45:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 10:45:02,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:02,362 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:45:02,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:45:02,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1409745750, now seen corresponding path program 1 times [2021-11-06 10:45:02,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:02,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589920680] [2021-11-06 10:45:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:02,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:02,867 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:45:02,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:02,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589920680] [2021-11-06 10:45:02,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589920680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:02,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:02,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:45:02,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113303698] [2021-11-06 10:45:02,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:45:02,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:45:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:45:02,869 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:12,852 INFO L93 Difference]: Finished difference Result 566 states and 618 transitions. [2021-11-06 10:45:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:45:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 10:45:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:12,854 INFO L225 Difference]: With dead ends: 566 [2021-11-06 10:45:12,854 INFO L226 Difference]: Without dead ends: 482 [2021-11-06 10:45:12,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:45:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-11-06 10:45:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 203. [2021-11-06 10:45:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 202 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2021-11-06 10:45:12,861 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 54 [2021-11-06 10:45:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:12,862 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2021-11-06 10:45:12,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2021-11-06 10:45:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 10:45:12,862 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:12,862 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:45:12,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:45:12,862 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937159, now seen corresponding path program 1 times [2021-11-06 10:45:12,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:12,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418402516] [2021-11-06 10:45:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:12,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:13,459 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:45:13,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:13,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418402516] [2021-11-06 10:45:13,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418402516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:13,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:13,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:45:13,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943448084] [2021-11-06 10:45:13,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:45:13,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:45:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:45:13,461 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:23,872 INFO L93 Difference]: Finished difference Result 502 states and 544 transitions. [2021-11-06 10:45:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:45:23,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 10:45:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:23,874 INFO L225 Difference]: With dead ends: 502 [2021-11-06 10:45:23,874 INFO L226 Difference]: Without dead ends: 457 [2021-11-06 10:45:23,875 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:45:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-06 10:45:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 173. [2021-11-06 10:45:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 172 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2021-11-06 10:45:23,881 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 55 [2021-11-06 10:45:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:23,881 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2021-11-06 10:45:23,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2021-11-06 10:45:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 10:45:23,882 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:23,882 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:45:23,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:45:23,882 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-06 10:45:23,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:23,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676279527] [2021-11-06 10:45:23,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:23,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:26,105 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:45:26,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:26,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676279527] [2021-11-06 10:45:26,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676279527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:26,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:26,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:45:26,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212135572] [2021-11-06 10:45:26,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:45:26,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:45:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:45:26,107 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:29,101 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2021-11-06 10:45:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:45:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 10:45:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:29,102 INFO L225 Difference]: With dead ends: 393 [2021-11-06 10:45:29,102 INFO L226 Difference]: Without dead ends: 243 [2021-11-06 10:45:29,103 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:45:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-06 10:45:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 177. [2021-11-06 10:45:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1104651162790697) internal successors, (191), 176 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2021-11-06 10:45:29,108 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 56 [2021-11-06 10:45:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:29,108 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2021-11-06 10:45:29,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2021-11-06 10:45:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 10:45:29,109 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:29,109 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:45:29,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:45:29,109 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1309942923, now seen corresponding path program 1 times [2021-11-06 10:45:29,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:29,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601127607] [2021-11-06 10:45:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:29,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:29,257 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:45:29,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:29,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601127607] [2021-11-06 10:45:29,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601127607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:29,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:29,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:45:29,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124722279] [2021-11-06 10:45:29,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:45:29,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:45:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:45:29,258 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:29,346 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2021-11-06 10:45:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:45:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 10:45:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:29,347 INFO L225 Difference]: With dead ends: 188 [2021-11-06 10:45:29,347 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 10:45:29,348 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:45:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 10:45:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 10:45:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1046511627906976) internal successors, (190), 176 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2021-11-06 10:45:29,353 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 58 [2021-11-06 10:45:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:29,353 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2021-11-06 10:45:29,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2021-11-06 10:45:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 10:45:29,353 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:29,353 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:45:29,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:45:29,353 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-06 10:45:29,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:29,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105570648] [2021-11-06 10:45:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:29,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:32,702 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:45:32,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:32,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105570648] [2021-11-06 10:45:32,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105570648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:32,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:32,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:45:32,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552208729] [2021-11-06 10:45:32,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:45:32,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:45:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:45:32,704 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:39,474 INFO L93 Difference]: Finished difference Result 435 states and 460 transitions. [2021-11-06 10:45:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:45:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 10:45:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:39,476 INFO L225 Difference]: With dead ends: 435 [2021-11-06 10:45:39,476 INFO L226 Difference]: Without dead ends: 300 [2021-11-06 10:45:39,476 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:45:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-06 10:45:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 177. [2021-11-06 10:45:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 176 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2021-11-06 10:45:39,484 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 59 [2021-11-06 10:45:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:39,484 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2021-11-06 10:45:39,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2021-11-06 10:45:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:45:39,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:39,485 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] [2021-11-06 10:45:39,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:45:39,485 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-06 10:45:39,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:39,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476052432] [2021-11-06 10:45:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:39,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:43,826 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:45:43,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:43,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476052432] [2021-11-06 10:45:43,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476052432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:43,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:43,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:45:43,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984498200] [2021-11-06 10:45:43,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:45:43,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:45:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:45:43,828 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:57,618 INFO L93 Difference]: Finished difference Result 371 states and 396 transitions. [2021-11-06 10:45:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 10:45:57,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 10:45:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:57,619 INFO L225 Difference]: With dead ends: 371 [2021-11-06 10:45:57,619 INFO L226 Difference]: Without dead ends: 300 [2021-11-06 10:45:57,620 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2021-11-06 10:45:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-06 10:45:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 221. [2021-11-06 10:45:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 220 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2021-11-06 10:45:57,629 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 62 [2021-11-06 10:45:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:57,629 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2021-11-06 10:45:57,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:45:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2021-11-06 10:45:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:45:57,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:57,630 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] [2021-11-06 10:45:57,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:45:57,630 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:45:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1831062709, now seen corresponding path program 1 times [2021-11-06 10:45:57,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:57,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650616653] [2021-11-06 10:45:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:57,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:58,286 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:45:58,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:58,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650616653] [2021-11-06 10:45:58,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650616653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:58,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:58,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:45:58,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468645285] [2021-11-06 10:45:58,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:45:58,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:58,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:45:58,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:45:58,287 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:05,903 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2021-11-06 10:46:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:46:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 10:46:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:05,904 INFO L225 Difference]: With dead ends: 278 [2021-11-06 10:46:05,904 INFO L226 Difference]: Without dead ends: 268 [2021-11-06 10:46:05,905 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:46:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-06 10:46:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2021-11-06 10:46:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 265 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2021-11-06 10:46:05,916 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 64 [2021-11-06 10:46:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:05,916 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2021-11-06 10:46:05,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2021-11-06 10:46:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:46:05,917 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:05,917 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] [2021-11-06 10:46:05,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:46:05,918 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:46:05,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2002093992, now seen corresponding path program 1 times [2021-11-06 10:46:05,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:05,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370482481] [2021-11-06 10:46:05,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:05,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:06,803 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:46:06,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:06,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370482481] [2021-11-06 10:46:06,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370482481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:06,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:06,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:46:06,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70596935] [2021-11-06 10:46:06,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:46:06,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:46:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:46:06,805 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:18,166 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2021-11-06 10:46:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:46:18,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 10:46:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:18,168 INFO L225 Difference]: With dead ends: 293 [2021-11-06 10:46:18,168 INFO L226 Difference]: Without dead ends: 233 [2021-11-06 10:46:18,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:46:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-06 10:46:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2021-11-06 10:46:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.1083743842364533) internal successors, (225), 207 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2021-11-06 10:46:18,177 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 64 [2021-11-06 10:46:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:18,177 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2021-11-06 10:46:18,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2021-11-06 10:46:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:46:18,178 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:18,178 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] [2021-11-06 10:46:18,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:46:18,178 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:46:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-06 10:46:18,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:18,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928208823] [2021-11-06 10:46:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:18,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:18,762 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:46:18,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:18,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928208823] [2021-11-06 10:46:18,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928208823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:18,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:18,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:46:18,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89269179] [2021-11-06 10:46:18,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:46:18,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:46:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:46:18,764 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:25,958 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2021-11-06 10:46:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:46:25,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 10:46:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:25,959 INFO L225 Difference]: With dead ends: 325 [2021-11-06 10:46:25,959 INFO L226 Difference]: Without dead ends: 317 [2021-11-06 10:46:25,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:46:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-06 10:46:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2021-11-06 10:46:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.1029411764705883) internal successors, (225), 208 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 225 transitions. [2021-11-06 10:46:25,968 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 225 transitions. Word has length 64 [2021-11-06 10:46:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:25,969 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 225 transitions. [2021-11-06 10:46:25,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:46:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2021-11-06 10:46:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 10:46:25,969 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:25,969 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:46:25,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:46:25,970 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:46:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-06 10:46:25,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:25,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065276266] [2021-11-06 10:46:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:25,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:46:29,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:29,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065276266] [2021-11-06 10:46:29,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065276266] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:46:29,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591345421] [2021-11-06 10:46:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:29,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:46:29,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:46:29,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 10:46:29,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 10:46:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:30,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-06 10:46:30,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:46:30,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 10:46:31,033 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 10:46:31,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-06 10:46:31,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-11-06 10:46:32,043 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-06 10:46:32,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-06 10:46:32,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2021-11-06 10:46:32,278 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-06 10:46:32,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 24 [2021-11-06 10:46:32,984 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-06 10:46:32,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2021-11-06 10:46:33,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:46:33,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:46:33,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2021-11-06 10:46:33,797 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 10:46:33,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2021-11-06 10:46:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 10:46:34,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591345421] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:46:34,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 10:46:34,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 26 [2021-11-06 10:46:34,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399967893] [2021-11-06 10:46:34,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-06 10:46:34,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-06 10:46:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:46:34,025 INFO L87 Difference]: Start difference. First operand 209 states and 225 transitions. Second operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:04,660 INFO L93 Difference]: Finished difference Result 352 states and 380 transitions. [2021-11-06 10:47:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-06 10:47:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 10:47:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:04,661 INFO L225 Difference]: With dead ends: 352 [2021-11-06 10:47:04,661 INFO L226 Difference]: Without dead ends: 278 [2021-11-06 10:47:04,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=754, Invalid=2552, Unknown=0, NotChecked=0, Total=3306 [2021-11-06 10:47:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-06 10:47:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 154. [2021-11-06 10:47:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.0728476821192052) internal successors, (162), 153 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2021-11-06 10:47:04,671 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 65 [2021-11-06 10:47:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:04,671 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2021-11-06 10:47:04,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2021-11-06 10:47:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:47:04,672 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:04,672 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:47:04,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-06 10:47:04,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-06 10:47:04,880 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:47:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-06 10:47:04,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:04,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401460187] [2021-11-06 10:47:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:04,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:05,420 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:47:05,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:05,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401460187] [2021-11-06 10:47:05,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401460187] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:05,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:05,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:47:05,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629948925] [2021-11-06 10:47:05,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:47:05,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:47:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:47:05,422 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:13,053 INFO L93 Difference]: Finished difference Result 300 states and 318 transitions. [2021-11-06 10:47:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:47:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 10:47:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:13,055 INFO L225 Difference]: With dead ends: 300 [2021-11-06 10:47:13,055 INFO L226 Difference]: Without dead ends: 236 [2021-11-06 10:47:13,055 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:47:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-06 10:47:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 160. [2021-11-06 10:47:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 157 states have (on average 1.0764331210191083) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2021-11-06 10:47:13,064 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 69 [2021-11-06 10:47:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:13,064 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2021-11-06 10:47:13,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2021-11-06 10:47:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 10:47:13,065 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:13,065 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:47:13,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:47:13,065 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:47:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1058361341, now seen corresponding path program 1 times [2021-11-06 10:47:13,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:13,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447341043] [2021-11-06 10:47:13,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:13,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 10:47:13,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:13,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447341043] [2021-11-06 10:47:13,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447341043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:13,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:13,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:47:13,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289952824] [2021-11-06 10:47:13,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:47:13,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:47:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:47:13,646 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:18,429 INFO L93 Difference]: Finished difference Result 239 states and 253 transitions. [2021-11-06 10:47:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:47:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-06 10:47:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:18,430 INFO L225 Difference]: With dead ends: 239 [2021-11-06 10:47:18,430 INFO L226 Difference]: Without dead ends: 182 [2021-11-06 10:47:18,430 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:47:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-06 10:47:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2021-11-06 10:47:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 173 states have (on average 1.0751445086705202) internal successors, (186), 175 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:47:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2021-11-06 10:47:18,456 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 72 [2021-11-06 10:47:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:18,456 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2021-11-06 10:47:18,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:47:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2021-11-06 10:47:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 10:47:18,456 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:18,456 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:47:18,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:47:18,457 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:47:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1034320377, now seen corresponding path program 1 times [2021-11-06 10:47:18,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:18,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775795676] [2021-11-06 10:47:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:18,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:47:19,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:19,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775795676] [2021-11-06 10:47:19,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775795676] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:47:19,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797110554] [2021-11-06 10:47:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:19,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:47:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:47:19,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 10:47:19,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 10:47:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:20,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2991 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-06 10:47:20,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:47:20,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 10:47:21,133 INFO L354 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-11-06 10:47:21,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2021-11-06 10:47:21,400 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-06 10:47:21,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2021-11-06 10:47:22,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:47:22,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:47:22,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:47:22,431 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 10:47:22,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2021-11-06 10:47:22,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:47:22,478 INFO L354 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2021-11-06 10:47:22,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 28 [2021-11-06 10:47:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:47:22,593 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-06 10:47:22,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2021-11-06 10:47:24,496 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 10:47:24,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2021-11-06 10:47:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:47:24,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797110554] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:47:24,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 10:47:24,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2021-11-06 10:47:24,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291458111] [2021-11-06 10:47:24,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-06 10:47:24,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:24,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-06 10:47:24,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2021-11-06 10:47:24,649 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:02,321 INFO L93 Difference]: Finished difference Result 364 states and 387 transitions. [2021-11-06 10:48:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-06 10:48:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-06 10:48:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:02,323 INFO L225 Difference]: With dead ends: 364 [2021-11-06 10:48:02,323 INFO L226 Difference]: Without dead ends: 293 [2021-11-06 10:48:02,324 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=729, Invalid=3303, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 10:48:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-06 10:48:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 170. [2021-11-06 10:48:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 1.0598802395209581) internal successors, (177), 169 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:48:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 177 transitions. [2021-11-06 10:48:02,348 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 177 transitions. Word has length 74 [2021-11-06 10:48:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:02,348 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 177 transitions. [2021-11-06 10:48:02,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 177 transitions. [2021-11-06 10:48:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 10:48:02,349 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:02,349 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:48:02,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 10:48:02,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-06 10:48:02,560 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:48:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 144726291, now seen corresponding path program 1 times [2021-11-06 10:48:02,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:02,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918782461] [2021-11-06 10:48:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:02,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:06,434 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:48:06,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:06,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918782461] [2021-11-06 10:48:06,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918782461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:06,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:06,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:48:06,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147600536] [2021-11-06 10:48:06,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:48:06,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:06,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:48:06,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:48:06,436 INFO L87 Difference]: Start difference. First operand 170 states and 177 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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:48:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:19,776 INFO L93 Difference]: Finished difference Result 280 states and 293 transitions. [2021-11-06 10:48:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 10:48:19,776 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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:48:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:19,777 INFO L225 Difference]: With dead ends: 280 [2021-11-06 10:48:19,777 INFO L226 Difference]: Without dead ends: 233 [2021-11-06 10:48:19,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2021-11-06 10:48:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-06 10:48:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2021-11-06 10:48:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 189 states have (on average 1.0634920634920635) internal successors, (201), 191 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2021-11-06 10:48:19,787 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 75 [2021-11-06 10:48:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:19,789 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2021-11-06 10:48:19,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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:48:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2021-11-06 10:48:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:48:19,789 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:19,789 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:48:19,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:48:19,790 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:48:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1442971818, now seen corresponding path program 1 times [2021-11-06 10:48:19,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:19,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078570247] [2021-11-06 10:48:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:19,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:20,392 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:48:20,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:20,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078570247] [2021-11-06 10:48:20,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078570247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:20,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:20,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:48:20,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085046125] [2021-11-06 10:48:20,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:48:20,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:48:20,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:48:20,394 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:25,418 INFO L93 Difference]: Finished difference Result 230 states and 240 transitions. [2021-11-06 10:48:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:48:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 10:48:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:25,419 INFO L225 Difference]: With dead ends: 230 [2021-11-06 10:48:25,419 INFO L226 Difference]: Without dead ends: 217 [2021-11-06 10:48:25,420 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:48:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-06 10:48:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2021-11-06 10:48:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 204 states have (on average 1.0588235294117647) internal successors, (216), 206 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 216 transitions. [2021-11-06 10:48:25,430 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 216 transitions. Word has length 76 [2021-11-06 10:48:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:25,430 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 216 transitions. [2021-11-06 10:48:25,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 216 transitions. [2021-11-06 10:48:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:48:25,431 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:25,431 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:48:25,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:48:25,431 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:48:25,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1271940535, now seen corresponding path program 1 times [2021-11-06 10:48:25,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:25,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834024953] [2021-11-06 10:48:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:25,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:48:25,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:25,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834024953] [2021-11-06 10:48:25,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834024953] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:25,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:25,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:48:25,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109670774] [2021-11-06 10:48:25,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:48:25,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:48:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:48:25,881 INFO L87 Difference]: Start difference. First operand 207 states and 216 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:33,341 INFO L93 Difference]: Finished difference Result 269 states and 279 transitions. [2021-11-06 10:48:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:48:33,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 10:48:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:33,342 INFO L225 Difference]: With dead ends: 269 [2021-11-06 10:48:33,342 INFO L226 Difference]: Without dead ends: 203 [2021-11-06 10:48:33,343 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:48:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-06 10:48:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2021-11-06 10:48:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 182 states have (on average 1.065934065934066) internal successors, (194), 184 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 194 transitions. [2021-11-06 10:48:33,352 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 194 transitions. Word has length 76 [2021-11-06 10:48:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:33,353 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 194 transitions. [2021-11-06 10:48:33,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 194 transitions. [2021-11-06 10:48:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 10:48:33,353 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:33,353 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:48:33,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:48:33,354 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:48:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1038906120, now seen corresponding path program 1 times [2021-11-06 10:48:33,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:33,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886057800] [2021-11-06 10:48:33,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:33,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-06 10:48:37,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:37,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886057800] [2021-11-06 10:48:37,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886057800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:37,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:37,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:48:37,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012633447] [2021-11-06 10:48:37,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:48:37,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:48:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:48:37,765 INFO L87 Difference]: Start difference. First operand 185 states and 194 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:51,696 INFO L93 Difference]: Finished difference Result 231 states and 242 transitions. [2021-11-06 10:48:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-06 10:48:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-06 10:48:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:51,698 INFO L225 Difference]: With dead ends: 231 [2021-11-06 10:48:51,698 INFO L226 Difference]: Without dead ends: 184 [2021-11-06 10:48:51,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2021-11-06 10:48:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-06 10:48:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 156. [2021-11-06 10:48:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.051948051948052) internal successors, (162), 155 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2021-11-06 10:48:51,711 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 80 [2021-11-06 10:48:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:51,711 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2021-11-06 10:48:51,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2021-11-06 10:48:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 10:48:51,715 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:51,715 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:48:51,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:48:51,715 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:48:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2124225498, now seen corresponding path program 1 times [2021-11-06 10:48:51,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:51,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495523317] [2021-11-06 10:48:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:51,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:52,627 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:48:52,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:52,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495523317] [2021-11-06 10:48:52,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495523317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:52,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:52,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:48:52,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918868679] [2021-11-06 10:48:52,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:48:52,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:52,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:48:52,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:48:52,628 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:57,809 INFO L93 Difference]: Finished difference Result 230 states and 240 transitions. [2021-11-06 10:48:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:48:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-06 10:48:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:57,811 INFO L225 Difference]: With dead ends: 230 [2021-11-06 10:48:57,811 INFO L226 Difference]: Without dead ends: 186 [2021-11-06 10:48:57,811 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:48:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-06 10:48:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2021-11-06 10:48:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 174 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2021-11-06 10:48:57,822 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 90 [2021-11-06 10:48:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:57,822 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2021-11-06 10:48:57,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:48:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2021-11-06 10:48:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:48:57,823 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:57,823 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:48:57,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:48:57,823 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:48:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1518276033, now seen corresponding path program 1 times [2021-11-06 10:48:57,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:57,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294475648] [2021-11-06 10:48:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:57,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 10:48:58,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:58,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294475648] [2021-11-06 10:48:58,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294475648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:58,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:58,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:48:58,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407994236] [2021-11-06 10:48:58,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:48:58,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:48:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:48:58,779 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:49:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:49:01,843 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2021-11-06 10:49:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:49:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:49:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:49:01,844 INFO L225 Difference]: With dead ends: 212 [2021-11-06 10:49:01,844 INFO L226 Difference]: Without dead ends: 175 [2021-11-06 10:49:01,845 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:49:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-06 10:49:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-06 10:49:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0404624277456647) internal successors, (180), 174 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:49:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 180 transitions. [2021-11-06 10:49:01,853 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 180 transitions. Word has length 93 [2021-11-06 10:49:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:49:01,854 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 180 transitions. [2021-11-06 10:49:01,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:49:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 180 transitions. [2021-11-06 10:49:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:49:01,854 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:49:01,855 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:49:01,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:49:01,855 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:49:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:49:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash -616554032, now seen corresponding path program 1 times [2021-11-06 10:49:01,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:49:01,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72747309] [2021-11-06 10:49:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:01,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:49:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:49:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:49:21,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:49:21,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72747309] [2021-11-06 10:49:21,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72747309] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:49:21,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471669229] [2021-11-06 10:49:21,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:21,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:49:21,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:49:21,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 10:49:21,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 10:53:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:53:52,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 3095 conjuncts, 179 conjunts are in the unsatisfiable core [2021-11-06 10:53:52,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:53:52,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 10:53:53,569 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 10:53:53,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-06 10:53:54,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-11-06 10:53:54,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 10:53:54,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-06 10:53:55,762 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-06 10:53:55,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 43 [2021-11-06 10:53:56,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:53:56,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-11-06 10:53:56,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:53:56,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2021-11-06 10:53:56,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2021-11-06 10:53:57,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:53:57,586 INFO L354 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2021-11-06 10:53:57,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-11-06 10:53:57,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:53:57,657 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-06 10:53:57,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 118 [2021-11-06 10:53:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:57,819 INFO L354 Elim1Store]: treesize reduction 272, result has 16.3 percent of original size [2021-11-06 10:53:57,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 163 [2021-11-06 10:53:57,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:57,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:57,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:57,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:57,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:57,999 INFO L354 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2021-11-06 10:53:58,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 74 [2021-11-06 10:53:58,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:53:59,059 INFO L354 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2021-11-06 10:53:59,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 61 [2021-11-06 10:54:03,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:54:03,091 INFO L354 Elim1Store]: treesize reduction 60, result has 17.8 percent of original size [2021-11-06 10:54:03,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 63 [2021-11-06 10:54:04,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-11-06 10:54:04,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:54:04,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:54:04,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2021-11-06 10:54:04,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 136 [2021-11-06 10:54:04,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 126 [2021-11-06 10:54:04,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:54:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:54:04,318 INFO L354 Elim1Store]: treesize reduction 193, result has 6.3 percent of original size [2021-11-06 10:54:04,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 144 treesize of output 132 [2021-11-06 10:54:12,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base] [2021-11-06 10:54:12,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-06 10:54:12,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-06 10:54:12,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680180603] [2021-11-06 10:54:12,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-06 10:54:12,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:54:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-06 10:54:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2295, Unknown=0, NotChecked=0, Total=2450 [2021-11-06 10:54:12,022 INFO L87 Difference]: Start difference. First operand 175 states and 180 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:55:33,586 INFO L93 Difference]: Finished difference Result 266 states and 273 transitions. [2021-11-06 10:55:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-06 10:55:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 10:55:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:55:33,587 INFO L225 Difference]: With dead ends: 266 [2021-11-06 10:55:33,587 INFO L226 Difference]: Without dead ends: 218 [2021-11-06 10:55:33,588 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=530, Invalid=4872, Unknown=0, NotChecked=0, Total=5402 [2021-11-06 10:55:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-06 10:55:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 177. [2021-11-06 10:55:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.04) internal successors, (182), 176 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 182 transitions. [2021-11-06 10:55:33,601 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 182 transitions. Word has length 99 [2021-11-06 10:55:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:55:33,601 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 182 transitions. [2021-11-06 10:55:33,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 182 transitions. [2021-11-06 10:55:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-06 10:55:33,602 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:55:33,602 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-06 10:55:33,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:55:33,819 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:55:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:55:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -771712428, now seen corresponding path program 1 times [2021-11-06 10:55:33,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:55:33,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818578931] [2021-11-06 10:55:33,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:55:33,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:55:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:55:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:55:34,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:55:34,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818578931] [2021-11-06 10:55:34,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818578931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:55:34,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:55:34,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:55:34,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684437830] [2021-11-06 10:55:34,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:55:34,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:55:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:55:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:55:34,505 INFO L87 Difference]: Start difference. First operand 177 states and 182 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:55:37,386 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2021-11-06 10:55:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:55:37,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2021-11-06 10:55:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:55:37,388 INFO L225 Difference]: With dead ends: 232 [2021-11-06 10:55:37,388 INFO L226 Difference]: Without dead ends: 188 [2021-11-06 10:55:37,388 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:55:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-06 10:55:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 161. [2021-11-06 10:55:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0377358490566038) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2021-11-06 10:55:37,399 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 101 [2021-11-06 10:55:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:55:37,399 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2021-11-06 10:55:37,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2021-11-06 10:55:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:55:37,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:55:37,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:55:37,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:55:37,400 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:55:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:55:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 836506168, now seen corresponding path program 1 times [2021-11-06 10:55:37,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:55:37,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955782679] [2021-11-06 10:55:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:55:37,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:55:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:55:38,221 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:55:38,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:55:38,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955782679] [2021-11-06 10:55:38,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955782679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:55:38,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:55:38,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:55:38,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649741972] [2021-11-06 10:55:38,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:55:38,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:55:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:55:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:55:38,222 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:55:50,666 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2021-11-06 10:55:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:55:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-06 10:55:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:55:50,667 INFO L225 Difference]: With dead ends: 239 [2021-11-06 10:55:50,667 INFO L226 Difference]: Without dead ends: 229 [2021-11-06 10:55:50,668 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:55:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-06 10:55:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 204. [2021-11-06 10:55:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 202 states have (on average 1.0297029702970297) internal successors, (208), 203 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:55:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2021-11-06 10:55:50,682 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 102 [2021-11-06 10:55:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:55:50,682 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2021-11-06 10:55:50,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:55:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2021-11-06 10:55:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:55:50,683 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:55:50,683 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:55:50,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:55:50,683 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:55:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:55:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1007537451, now seen corresponding path program 1 times [2021-11-06 10:55:50,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:55:50,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812821527] [2021-11-06 10:55:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:55:50,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:55:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:55:54,084 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:55:54,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:55:54,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812821527] [2021-11-06 10:55:54,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812821527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:55:54,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:55:54,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:55:54,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856325652] [2021-11-06 10:55:54,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:55:54,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:55:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:55:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:55:54,086 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:56:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:56:13,314 INFO L93 Difference]: Finished difference Result 228 states and 231 transitions. [2021-11-06 10:56:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 10:56:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-06 10:56:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:56:13,315 INFO L225 Difference]: With dead ends: 228 [2021-11-06 10:56:13,315 INFO L226 Difference]: Without dead ends: 215 [2021-11-06 10:56:13,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 10:56:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-06 10:56:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2021-11-06 10:56:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 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:56:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2021-11-06 10:56:13,331 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 102 [2021-11-06 10:56:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:56:13,331 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2021-11-06 10:56:13,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:56:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2021-11-06 10:56:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-06 10:56:13,331 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:56:13,332 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 10:56:13,332 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 10:56:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:56:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 642444485, now seen corresponding path program 2 times [2021-11-06 10:56:13,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:56:13,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68841728] [2021-11-06 10:56:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:56:13,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:56:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:56:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 10:56:26,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:56:26,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68841728] [2021-11-06 10:56:26,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68841728] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:56:26,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027067339] [2021-11-06 10:56:26,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 10:56:26,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:56:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:56:26,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 10:56:26,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Killed by 15