./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_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 01ad56e04b6ab93ff162b70d622a1dbeae0350a0f6dc141a393bf37a9fe53f01 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:15:09,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:15:09,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:15:09,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:15:09,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:15:09,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:15:09,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:15:09,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:15:09,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:15:09,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:15:09,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:15:09,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:15:09,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:15:09,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:15:09,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:15:09,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:15:09,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:15:09,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:15:09,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:15:09,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:15:09,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:15:09,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:15:09,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:15:09,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:15:09,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:15:09,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:15:09,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:15:09,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:15:09,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:15:09,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:15:09,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:15:09,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:15:09,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:15:09,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:15:09,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:15:09,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:15:09,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:15:09,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:15:09,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:15:09,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:15:09,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:15:09,339 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:15:09,353 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:15:09,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:15:09,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:15:09,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:15:09,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:15:09,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:15:09,355 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:15:09,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:15:09,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:15:09,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:15:09,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:15:09,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:15:09,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:15:09,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:15:09,357 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:15:09,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:15:09,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:15:09,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:15:09,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:15:09,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:15:09,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:15:09,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:15:09,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:15:09,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:15:09,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:15:09,358 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:15:09,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:15:09,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:15:09,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:15:09,359 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 -> 01ad56e04b6ab93ff162b70d622a1dbeae0350a0f6dc141a393bf37a9fe53f01 [2021-11-06 10:15:09,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:15:09,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:15:09,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:15:09,559 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:15:09,560 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:15:09,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i [2021-11-06 10:15:09,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bbd7d4d/7ad671568ec64e45831b03343500fc1b/FLAGd131253fa [2021-11-06 10:15:10,154 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:15:10,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i [2021-11-06 10:15:10,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bbd7d4d/7ad671568ec64e45831b03343500fc1b/FLAGd131253fa [2021-11-06 10:15:10,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bbd7d4d/7ad671568ec64e45831b03343500fc1b [2021-11-06 10:15:10,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:15:10,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:15:10,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:15:10,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:15:10,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:15:10,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:10" (1/1) ... [2021-11-06 10:15:10,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b454322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:10, skipping insertion in model container [2021-11-06 10:15:10,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:10" (1/1) ... [2021-11-06 10:15:10,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:15:10,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:15:10,864 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i[4505,4518] [2021-11-06 10:15:10,870 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i[4565,4578] [2021-11-06 10:15:10,884 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:15:10,889 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:15:11,432 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,432 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,433 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,433 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,434 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,442 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,443 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,447 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,447 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,742 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:15:11,743 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:15:11,743 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:15:11,744 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:15:11,745 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:15:11,745 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:15:11,746 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:15:11,746 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:15:11,746 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:15:11,747 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:15:11,845 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:15:11,858 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,858 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,934 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,936 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:11,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:15:12,048 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:15:12,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i[4505,4518] [2021-11-06 10:15:12,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_append_with_lookup_harness.i[4565,4578] [2021-11-06 10:15:12,073 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:15:12,073 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:15:12,099 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,099 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,100 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,100 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,101 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,107 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,107 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,108 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,108 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,138 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:15:12,139 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:15:12,139 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:15:12,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:15:12,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:15:12,141 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:15:12,141 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:15:12,141 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:15:12,142 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:15:12,143 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:15:12,164 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:15:12,174 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,175 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,207 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,207 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:12,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:15:12,407 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:15:12,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12 WrapperNode [2021-11-06 10:15:12,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:15:12,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:15:12,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:15:12,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:15:12,414 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:15:12" (1/1) ... [2021-11-06 10:15:12,517 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:15:12" (1/1) ... [2021-11-06 10:15:12,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:15:12,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:15:12,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:15:12,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:15:12,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:15:12,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:15:12,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:15:12,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:15:12,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (1/1) ... [2021-11-06 10:15:12,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:15:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:15:12,741 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:15:12,775 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:15:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:15:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:15:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:15:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:15:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:15:12,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:15:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-06 10:15:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:15:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:15:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:15:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:15:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:15:19,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:15:19,567 INFO L299 CfgBuilder]: Removed 121 assume(true) statements. [2021-11-06 10:15:19,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:19 BoogieIcfgContainer [2021-11-06 10:15:19,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:15:19,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:15:19,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:15:19,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:15:19,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:10" (1/3) ... [2021-11-06 10:15:19,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433601a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:19, skipping insertion in model container [2021-11-06 10:15:19,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12" (2/3) ... [2021-11-06 10:15:19,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433601a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:19, skipping insertion in model container [2021-11-06 10:15:19,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:19" (3/3) ... [2021-11-06 10:15:19,576 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_append_with_lookup_harness.i [2021-11-06 10:15:19,579 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:15:19,580 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2021-11-06 10:15:19,618 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:15:19,622 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:15:19,623 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2021-11-06 10:15:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 236 states have (on average 1.4703389830508475) internal successors, (347), 251 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 10:15:19,653 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:19,654 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] [2021-11-06 10:15:19,655 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1615139171, now seen corresponding path program 1 times [2021-11-06 10:15:19,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:19,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543040101] [2021-11-06 10:15:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:19,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:20,170 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:15:20,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:20,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543040101] [2021-11-06 10:15:20,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543040101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:20,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:20,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:15:20,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517644388] [2021-11-06 10:15:20,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:15:20,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:15:20,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:15:20,204 INFO L87 Difference]: Start difference. First operand has 252 states, 236 states have (on average 1.4703389830508475) internal successors, (347), 251 states have internal predecessors, (347), 0 states have call successors, (0), 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 23.5) internal successors, (47), 2 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:15:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:20,242 INFO L93 Difference]: Finished difference Result 500 states and 689 transitions. [2021-11-06 10:15:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:15:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 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:15:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:20,252 INFO L225 Difference]: With dead ends: 500 [2021-11-06 10:15:20,252 INFO L226 Difference]: Without dead ends: 247 [2021-11-06 10:15:20,255 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:15:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-06 10:15:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-11-06 10:15:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.3577586206896552) internal successors, (315), 246 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 315 transitions. [2021-11-06 10:15:20,289 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 315 transitions. Word has length 47 [2021-11-06 10:15:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:20,290 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 315 transitions. [2021-11-06 10:15:20,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 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:15:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 315 transitions. [2021-11-06 10:15:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 10:15:20,292 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:20,292 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] [2021-11-06 10:15:20,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:15:20,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1441117657, now seen corresponding path program 1 times [2021-11-06 10:15:20,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:20,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181882739] [2021-11-06 10:15:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:20,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:20,624 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:15:20,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:20,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181882739] [2021-11-06 10:15:20,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181882739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:20,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:20,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:20,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514738408] [2021-11-06 10:15:20,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:20,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:20,627 INFO L87 Difference]: Start difference. First operand 247 states and 315 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:15:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:20,777 INFO L93 Difference]: Finished difference Result 468 states and 596 transitions. [2021-11-06 10:15:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:15:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:15:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:20,780 INFO L225 Difference]: With dead ends: 468 [2021-11-06 10:15:20,780 INFO L226 Difference]: Without dead ends: 247 [2021-11-06 10:15:20,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-06 10:15:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-11-06 10:15:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.3448275862068966) internal successors, (312), 246 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 312 transitions. [2021-11-06 10:15:20,789 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 312 transitions. Word has length 47 [2021-11-06 10:15:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:20,789 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 312 transitions. [2021-11-06 10:15:20,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:15:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 312 transitions. [2021-11-06 10:15:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 10:15:20,791 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:20,791 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:15:20,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:15:20,792 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1376891287, now seen corresponding path program 1 times [2021-11-06 10:15:20,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:20,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820901185] [2021-11-06 10:15:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:20,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:21,052 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:15:21,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:21,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820901185] [2021-11-06 10:15:21,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820901185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:21,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:21,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:21,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846382894] [2021-11-06 10:15:21,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:21,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:21,053 INFO L87 Difference]: Start difference. First operand 247 states and 312 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:15:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:21,383 INFO L93 Difference]: Finished difference Result 519 states and 662 transitions. [2021-11-06 10:15:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:21,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:15:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:21,385 INFO L225 Difference]: With dead ends: 519 [2021-11-06 10:15:21,385 INFO L226 Difference]: Without dead ends: 297 [2021-11-06 10:15:21,386 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:15:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-06 10:15:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 257. [2021-11-06 10:15:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 242 states have (on average 1.3305785123966942) internal successors, (322), 256 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 322 transitions. [2021-11-06 10:15:21,394 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 322 transitions. Word has length 59 [2021-11-06 10:15:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:21,394 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 322 transitions. [2021-11-06 10:15:21,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:15:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 322 transitions. [2021-11-06 10:15:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 10:15:21,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:21,396 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:15:21,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:15:21,396 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash -868688167, now seen corresponding path program 1 times [2021-11-06 10:15:21,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:21,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660824591] [2021-11-06 10:15:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:21,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:21,737 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:15:21,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:21,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660824591] [2021-11-06 10:15:21,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660824591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:21,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:21,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:15:21,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042687431] [2021-11-06 10:15:21,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:15:21,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:21,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:15:21,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:15:21,739 INFO L87 Difference]: Start difference. First operand 257 states and 322 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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:15:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:21,988 INFO L93 Difference]: Finished difference Result 383 states and 471 transitions. [2021-11-06 10:15:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:15:21,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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:15:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:21,990 INFO L225 Difference]: With dead ends: 383 [2021-11-06 10:15:21,990 INFO L226 Difference]: Without dead ends: 257 [2021-11-06 10:15:21,991 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:15:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-06 10:15:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2021-11-06 10:15:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 242 states have (on average 1.322314049586777) internal successors, (320), 256 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 320 transitions. [2021-11-06 10:15:21,996 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 320 transitions. Word has length 59 [2021-11-06 10:15:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:21,996 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 320 transitions. [2021-11-06 10:15:21,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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:15:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 320 transitions. [2021-11-06 10:15:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 10:15:21,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:21,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:21,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:15:21,998 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1883881006, now seen corresponding path program 1 times [2021-11-06 10:15:21,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:21,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535711701] [2021-11-06 10:15:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:21,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:22,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:15:22,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:22,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535711701] [2021-11-06 10:15:22,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535711701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:22,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:22,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:22,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948317994] [2021-11-06 10:15:22,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:22,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:22,188 INFO L87 Difference]: Start difference. First operand 257 states and 320 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:22,293 INFO L93 Difference]: Finished difference Result 463 states and 576 transitions. [2021-11-06 10:15:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:15:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 10:15:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:22,295 INFO L225 Difference]: With dead ends: 463 [2021-11-06 10:15:22,295 INFO L226 Difference]: Without dead ends: 257 [2021-11-06 10:15:22,295 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-06 10:15:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2021-11-06 10:15:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 242 states have (on average 1.3140495867768596) internal successors, (318), 256 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 318 transitions. [2021-11-06 10:15:22,299 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 318 transitions. Word has length 65 [2021-11-06 10:15:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:22,299 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 318 transitions. [2021-11-06 10:15:22,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 318 transitions. [2021-11-06 10:15:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 10:15:22,301 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:22,301 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:22,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:15:22,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1435554775, now seen corresponding path program 1 times [2021-11-06 10:15:22,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:22,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083946558] [2021-11-06 10:15:22,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:22,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:22,589 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:15:22,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:22,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083946558] [2021-11-06 10:15:22,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083946558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:22,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:22,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:15:22,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395060273] [2021-11-06 10:15:22,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:15:22,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:15:22,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:15:22,591 INFO L87 Difference]: Start difference. First operand 257 states and 318 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:22,869 INFO L93 Difference]: Finished difference Result 431 states and 530 transitions. [2021-11-06 10:15:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:15:22,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 10:15:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:22,871 INFO L225 Difference]: With dead ends: 431 [2021-11-06 10:15:22,871 INFO L226 Difference]: Without dead ends: 257 [2021-11-06 10:15:22,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:15:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-06 10:15:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2021-11-06 10:15:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 256 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 315 transitions. [2021-11-06 10:15:22,876 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 315 transitions. Word has length 67 [2021-11-06 10:15:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:22,876 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 315 transitions. [2021-11-06 10:15:22,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 315 transitions. [2021-11-06 10:15:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 10:15:22,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:22,877 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:22,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:15:22,877 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1050165348, now seen corresponding path program 1 times [2021-11-06 10:15:22,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:22,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464141514] [2021-11-06 10:15:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:22,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:23,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:23,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464141514] [2021-11-06 10:15:23,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464141514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:23,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:23,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:15:23,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308559678] [2021-11-06 10:15:23,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:15:23,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:15:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:15:23,346 INFO L87 Difference]: Start difference. First operand 257 states and 315 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:15:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:23,876 INFO L93 Difference]: Finished difference Result 431 states and 516 transitions. [2021-11-06 10:15:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:15:23,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:15:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:23,877 INFO L225 Difference]: With dead ends: 431 [2021-11-06 10:15:23,878 INFO L226 Difference]: Without dead ends: 425 [2021-11-06 10:15:23,878 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:15:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-11-06 10:15:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 269. [2021-11-06 10:15:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 254 states have (on average 1.2874015748031495) internal successors, (327), 268 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 327 transitions. [2021-11-06 10:15:23,884 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 327 transitions. Word has length 69 [2021-11-06 10:15:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:23,885 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 327 transitions. [2021-11-06 10:15:23,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:15:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 327 transitions. [2021-11-06 10:15:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 10:15:23,886 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:23,886 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] [2021-11-06 10:15:23,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:15:23,886 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1899719168, now seen corresponding path program 1 times [2021-11-06 10:15:23,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:23,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502032892] [2021-11-06 10:15:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:23,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:24,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:24,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502032892] [2021-11-06 10:15:24,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502032892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:24,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:24,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:15:24,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517945967] [2021-11-06 10:15:24,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:15:24,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:15:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:24,108 INFO L87 Difference]: Start difference. First operand 269 states and 327 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:24,209 INFO L93 Difference]: Finished difference Result 484 states and 577 transitions. [2021-11-06 10:15:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-11-06 10:15:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:24,211 INFO L225 Difference]: With dead ends: 484 [2021-11-06 10:15:24,211 INFO L226 Difference]: Without dead ends: 398 [2021-11-06 10:15:24,211 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:15:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-06 10:15:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 272. [2021-11-06 10:15:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 257 states have (on average 1.284046692607004) internal successors, (330), 271 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 330 transitions. [2021-11-06 10:15:24,218 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 330 transitions. Word has length 70 [2021-11-06 10:15:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:24,218 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 330 transitions. [2021-11-06 10:15:24,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 330 transitions. [2021-11-06 10:15:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 10:15:24,219 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:24,219 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] [2021-11-06 10:15:24,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:15:24,220 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1656689084, now seen corresponding path program 1 times [2021-11-06 10:15:24,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:24,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370896959] [2021-11-06 10:15:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:24,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:37,044 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:15:37,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:37,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370896959] [2021-11-06 10:15:37,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370896959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:37,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:37,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:15:37,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758600851] [2021-11-06 10:15:37,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:15:37,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:15:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:15:37,051 INFO L87 Difference]: Start difference. First operand 272 states and 330 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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:15:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:40,373 INFO L93 Difference]: Finished difference Result 549 states and 670 transitions. [2021-11-06 10:15:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:15:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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:15:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:40,374 INFO L225 Difference]: With dead ends: 549 [2021-11-06 10:15:40,374 INFO L226 Difference]: Without dead ends: 304 [2021-11-06 10:15:40,375 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:15:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-06 10:15:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 270. [2021-11-06 10:15:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 255 states have (on average 1.2823529411764707) internal successors, (327), 269 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 327 transitions. [2021-11-06 10:15:40,380 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 327 transitions. Word has length 72 [2021-11-06 10:15:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:40,380 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 327 transitions. [2021-11-06 10:15:40,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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:15:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 327 transitions. [2021-11-06 10:15:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:15:40,381 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:40,381 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:15:40,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:15:40,381 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:40,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1518272178, now seen corresponding path program 1 times [2021-11-06 10:15:40,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:40,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446052213] [2021-11-06 10:15:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:40,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:41,496 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:15:41,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:41,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446052213] [2021-11-06 10:15:41,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446052213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:41,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:41,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:15:41,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714888727] [2021-11-06 10:15:41,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:15:41,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:41,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:15:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:15:41,498 INFO L87 Difference]: Start difference. First operand 270 states and 327 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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:15:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:51,097 INFO L93 Difference]: Finished difference Result 429 states and 514 transitions. [2021-11-06 10:15:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:15:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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:15:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:51,099 INFO L225 Difference]: With dead ends: 429 [2021-11-06 10:15:51,099 INFO L226 Difference]: Without dead ends: 427 [2021-11-06 10:15:51,099 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:15:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-06 10:15:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 319. [2021-11-06 10:15:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 304 states have (on average 1.2894736842105263) internal successors, (392), 318 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 392 transitions. [2021-11-06 10:15:51,107 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 392 transitions. Word has length 76 [2021-11-06 10:15:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:51,107 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 392 transitions. [2021-11-06 10:15:51,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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:15:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 392 transitions. [2021-11-06 10:15:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:15:51,108 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:51,108 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:15:51,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:15:51,108 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:51,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:51,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1518283101, now seen corresponding path program 1 times [2021-11-06 10:15:51,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:51,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111726876] [2021-11-06 10:15:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:51,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:51,259 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:15:51,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:51,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111726876] [2021-11-06 10:15:51,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111726876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:51,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:51,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:51,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973622843] [2021-11-06 10:15:51,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:51,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:51,261 INFO L87 Difference]: Start difference. First operand 319 states and 392 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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:15:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:51,320 INFO L93 Difference]: Finished difference Result 472 states and 568 transitions. [2021-11-06 10:15:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:15:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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:15:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:51,321 INFO L225 Difference]: With dead ends: 472 [2021-11-06 10:15:51,321 INFO L226 Difference]: Without dead ends: 404 [2021-11-06 10:15:51,322 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:15:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-11-06 10:15:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 323. [2021-11-06 10:15:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 308 states have (on average 1.2857142857142858) internal successors, (396), 322 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 396 transitions. [2021-11-06 10:15:51,330 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 396 transitions. Word has length 76 [2021-11-06 10:15:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:51,330 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 396 transitions. [2021-11-06 10:15:51,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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:15:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 396 transitions. [2021-11-06 10:15:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 10:15:51,331 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:51,331 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:51,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:15:51,332 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -811165614, now seen corresponding path program 1 times [2021-11-06 10:15:51,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:51,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713227697] [2021-11-06 10:15:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:51,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:51,854 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:15:51,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:51,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713227697] [2021-11-06 10:15:51,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713227697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:51,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:51,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:15:51,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805525731] [2021-11-06 10:15:51,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:15:51,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:51,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:15:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:15:51,855 INFO L87 Difference]: Start difference. First operand 323 states and 396 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:59,547 INFO L93 Difference]: Finished difference Result 655 states and 786 transitions. [2021-11-06 10:15:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:15:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-06 10:15:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:59,549 INFO L225 Difference]: With dead ends: 655 [2021-11-06 10:15:59,549 INFO L226 Difference]: Without dead ends: 529 [2021-11-06 10:15:59,549 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:15:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-11-06 10:15:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 363. [2021-11-06 10:15:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 348 states have (on average 1.2816091954022988) internal successors, (446), 362 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2021-11-06 10:15:59,560 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 77 [2021-11-06 10:15:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:59,561 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2021-11-06 10:15:59,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2021-11-06 10:15:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 10:15:59,562 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:59,562 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:59,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:15:59,562 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:15:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -540788130, now seen corresponding path program 1 times [2021-11-06 10:15:59,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:59,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705441538] [2021-11-06 10:15:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:59,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:00,149 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:16:00,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:00,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705441538] [2021-11-06 10:16:00,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705441538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:00,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:00,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:00,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481143903] [2021-11-06 10:16:00,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:00,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:00,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:00,151 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:00,937 INFO L93 Difference]: Finished difference Result 851 states and 1032 transitions. [2021-11-06 10:16:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:16:00,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 10:16:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:00,939 INFO L225 Difference]: With dead ends: 851 [2021-11-06 10:16:00,939 INFO L226 Difference]: Without dead ends: 502 [2021-11-06 10:16:00,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:16:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-06 10:16:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 363. [2021-11-06 10:16:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 348 states have (on average 1.2729885057471264) internal successors, (443), 362 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 443 transitions. [2021-11-06 10:16:00,951 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 443 transitions. Word has length 79 [2021-11-06 10:16:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:00,951 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 443 transitions. [2021-11-06 10:16:00,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 443 transitions. [2021-11-06 10:16:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:16:00,952 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:00,952 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:00,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:16:00,953 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1102134247, now seen corresponding path program 1 times [2021-11-06 10:16:00,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:00,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097134827] [2021-11-06 10:16:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:00,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:01,481 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:16:01,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:01,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097134827] [2021-11-06 10:16:01,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097134827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:01,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:01,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:16:01,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405604048] [2021-11-06 10:16:01,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:16:01,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:16:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:01,482 INFO L87 Difference]: Start difference. First operand 363 states and 443 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:04,466 INFO L93 Difference]: Finished difference Result 1060 states and 1292 transitions. [2021-11-06 10:16:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:16:04,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 10:16:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:04,468 INFO L225 Difference]: With dead ends: 1060 [2021-11-06 10:16:04,468 INFO L226 Difference]: Without dead ends: 717 [2021-11-06 10:16:04,469 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-11-06 10:16:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 410. [2021-11-06 10:16:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 395 states have (on average 1.2734177215189872) internal successors, (503), 409 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 503 transitions. [2021-11-06 10:16:04,480 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 503 transitions. Word has length 81 [2021-11-06 10:16:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:04,480 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 503 transitions. [2021-11-06 10:16:04,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 503 transitions. [2021-11-06 10:16:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:16:04,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:04,481 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:04,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:16:04,481 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1519530853, now seen corresponding path program 1 times [2021-11-06 10:16:04,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:04,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112738234] [2021-11-06 10:16:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:04,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:04,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:04,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112738234] [2021-11-06 10:16:04,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112738234] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:04,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:04,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:16:04,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103585581] [2021-11-06 10:16:04,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:16:04,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:16:04,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:16:04,616 INFO L87 Difference]: Start difference. First operand 410 states and 503 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:04,866 INFO L93 Difference]: Finished difference Result 831 states and 1016 transitions. [2021-11-06 10:16:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:16:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 10:16:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:04,867 INFO L225 Difference]: With dead ends: 831 [2021-11-06 10:16:04,867 INFO L226 Difference]: Without dead ends: 431 [2021-11-06 10:16:04,868 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:16:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-06 10:16:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2021-11-06 10:16:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 392 states have (on average 1.2525510204081634) internal successors, (491), 406 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 491 transitions. [2021-11-06 10:16:04,878 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 491 transitions. Word has length 81 [2021-11-06 10:16:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:04,878 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 491 transitions. [2021-11-06 10:16:04,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 491 transitions. [2021-11-06 10:16:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:16:04,880 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:04,880 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:04,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:16:04,881 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash -148194089, now seen corresponding path program 1 times [2021-11-06 10:16:04,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:04,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293116309] [2021-11-06 10:16:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:04,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:07,546 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:16:07,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:07,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293116309] [2021-11-06 10:16:07,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293116309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:07,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:07,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:16:07,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894990370] [2021-11-06 10:16:07,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:16:07,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:16:07,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:16:07,548 INFO L87 Difference]: Start difference. First operand 407 states and 491 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:18,452 INFO L93 Difference]: Finished difference Result 576 states and 684 transitions. [2021-11-06 10:16:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:16:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 10:16:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:18,454 INFO L225 Difference]: With dead ends: 576 [2021-11-06 10:16:18,454 INFO L226 Difference]: Without dead ends: 574 [2021-11-06 10:16:18,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:16:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-11-06 10:16:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 415. [2021-11-06 10:16:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 400 states have (on average 1.2525) internal successors, (501), 414 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 501 transitions. [2021-11-06 10:16:18,466 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 501 transitions. Word has length 81 [2021-11-06 10:16:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:18,466 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 501 transitions. [2021-11-06 10:16:18,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 501 transitions. [2021-11-06 10:16:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 10:16:18,467 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:18,467 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] [2021-11-06 10:16:18,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:16:18,467 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -418304145, now seen corresponding path program 1 times [2021-11-06 10:16:18,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:18,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328876405] [2021-11-06 10:16:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:18,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:19,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:19,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328876405] [2021-11-06 10:16:19,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328876405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:19,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:19,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:16:19,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356254712] [2021-11-06 10:16:19,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:16:19,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:16:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:16:19,504 INFO L87 Difference]: Start difference. First operand 415 states and 501 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:29,737 INFO L93 Difference]: Finished difference Result 757 states and 901 transitions. [2021-11-06 10:16:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:16:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 10:16:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:29,739 INFO L225 Difference]: With dead ends: 757 [2021-11-06 10:16:29,739 INFO L226 Difference]: Without dead ends: 597 [2021-11-06 10:16:29,740 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:16:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-11-06 10:16:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 417. [2021-11-06 10:16:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 402 states have (on average 1.2512437810945274) internal successors, (503), 416 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 503 transitions. [2021-11-06 10:16:29,753 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 503 transitions. Word has length 81 [2021-11-06 10:16:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:29,753 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 503 transitions. [2021-11-06 10:16:29,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 503 transitions. [2021-11-06 10:16:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 10:16:29,754 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:29,754 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] [2021-11-06 10:16:29,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:16:29,754 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1797412037, now seen corresponding path program 1 times [2021-11-06 10:16:29,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:29,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274062223] [2021-11-06 10:16:29,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:29,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:30,150 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:16:30,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:30,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274062223] [2021-11-06 10:16:30,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274062223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:30,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:30,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:30,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21539698] [2021-11-06 10:16:30,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:30,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:30,151 INFO L87 Difference]: Start difference. First operand 417 states and 503 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:30,931 INFO L93 Difference]: Finished difference Result 880 states and 1050 transitions. [2021-11-06 10:16:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:16:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-06 10:16:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:30,933 INFO L225 Difference]: With dead ends: 880 [2021-11-06 10:16:30,933 INFO L226 Difference]: Without dead ends: 540 [2021-11-06 10:16:30,934 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-11-06 10:16:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 417. [2021-11-06 10:16:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 402 states have (on average 1.243781094527363) internal successors, (500), 416 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 500 transitions. [2021-11-06 10:16:30,945 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 500 transitions. Word has length 83 [2021-11-06 10:16:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:30,945 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 500 transitions. [2021-11-06 10:16:30,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 500 transitions. [2021-11-06 10:16:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 10:16:30,946 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:30,946 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] [2021-11-06 10:16:30,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:16:30,946 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1272186599, now seen corresponding path program 1 times [2021-11-06 10:16:30,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:30,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614573881] [2021-11-06 10:16:30,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:30,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:32,068 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:16:32,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:32,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614573881] [2021-11-06 10:16:32,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614573881] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:32,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:32,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:16:32,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537485096] [2021-11-06 10:16:32,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:16:32,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:16:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:32,069 INFO L87 Difference]: Start difference. First operand 417 states and 500 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:43,020 INFO L93 Difference]: Finished difference Result 832 states and 995 transitions. [2021-11-06 10:16:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:16:43,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-06 10:16:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:43,023 INFO L225 Difference]: With dead ends: 832 [2021-11-06 10:16:43,023 INFO L226 Difference]: Without dead ends: 740 [2021-11-06 10:16:43,023 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:16:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-11-06 10:16:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 596. [2021-11-06 10:16:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 581 states have (on average 1.2512908777969018) internal successors, (727), 595 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 727 transitions. [2021-11-06 10:16:43,043 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 727 transitions. Word has length 83 [2021-11-06 10:16:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:43,043 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 727 transitions. [2021-11-06 10:16:43,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 727 transitions. [2021-11-06 10:16:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:16:43,044 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:43,044 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:43,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:16:43,044 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash -80015264, now seen corresponding path program 1 times [2021-11-06 10:16:43,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:43,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518449568] [2021-11-06 10:16:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:43,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:43,353 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:16:43,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:43,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518449568] [2021-11-06 10:16:43,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518449568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:43,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:43,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:16:43,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384498387] [2021-11-06 10:16:43,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:16:43,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:16:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:43,355 INFO L87 Difference]: Start difference. First operand 596 states and 727 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:48,581 INFO L93 Difference]: Finished difference Result 1415 states and 1717 transitions. [2021-11-06 10:16:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:16:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-06 10:16:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:48,586 INFO L225 Difference]: With dead ends: 1415 [2021-11-06 10:16:48,586 INFO L226 Difference]: Without dead ends: 916 [2021-11-06 10:16:48,587 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:16:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-11-06 10:16:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 596. [2021-11-06 10:16:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 581 states have (on average 1.2306368330464716) internal successors, (715), 595 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 715 transitions. [2021-11-06 10:16:48,607 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 715 transitions. Word has length 85 [2021-11-06 10:16:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:48,607 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 715 transitions. [2021-11-06 10:16:48,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 715 transitions. [2021-11-06 10:16:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:16:48,608 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:48,608 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:48,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:16:48,609 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:16:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2129403106, now seen corresponding path program 1 times [2021-11-06 10:16:48,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:48,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872750874] [2021-11-06 10:16:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:48,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:49,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:49,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872750874] [2021-11-06 10:16:49,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872750874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:49,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:49,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:16:49,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132863769] [2021-11-06 10:16:49,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:16:49,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:49,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:16:49,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:16:49,253 INFO L87 Difference]: Start difference. First operand 596 states and 715 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:01,880 INFO L93 Difference]: Finished difference Result 1245 states and 1499 transitions. [2021-11-06 10:17:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:17:01,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-06 10:17:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:01,883 INFO L225 Difference]: With dead ends: 1245 [2021-11-06 10:17:01,883 INFO L226 Difference]: Without dead ends: 827 [2021-11-06 10:17:01,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:17:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-11-06 10:17:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 751. [2021-11-06 10:17:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 736 states have (on average 1.2309782608695652) internal successors, (906), 750 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 906 transitions. [2021-11-06 10:17:01,911 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 906 transitions. Word has length 85 [2021-11-06 10:17:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:01,911 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 906 transitions. [2021-11-06 10:17:01,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 906 transitions. [2021-11-06 10:17:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:17:01,912 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:01,912 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:01,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:17:01,912 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:17:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -380987548, now seen corresponding path program 1 times [2021-11-06 10:17:01,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:01,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154923595] [2021-11-06 10:17:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:01,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:04,314 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:17:04,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:04,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154923595] [2021-11-06 10:17:04,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154923595] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:04,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:04,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:17:04,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461629335] [2021-11-06 10:17:04,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:17:04,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:04,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:17:04,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:17:04,315 INFO L87 Difference]: Start difference. First operand 751 states and 906 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:17,164 INFO L93 Difference]: Finished difference Result 1347 states and 1618 transitions. [2021-11-06 10:17:17,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 10:17:17,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-06 10:17:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:17,168 INFO L225 Difference]: With dead ends: 1347 [2021-11-06 10:17:17,168 INFO L226 Difference]: Without dead ends: 891 [2021-11-06 10:17:17,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:17:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-11-06 10:17:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 745. [2021-11-06 10:17:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 730 states have (on average 1.2301369863013698) internal successors, (898), 744 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 898 transitions. [2021-11-06 10:17:17,192 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 898 transitions. Word has length 87 [2021-11-06 10:17:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:17,192 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 898 transitions. [2021-11-06 10:17:17,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 898 transitions. [2021-11-06 10:17:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 10:17:17,193 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:17,193 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:17,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:17:17,193 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:17:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1898515690, now seen corresponding path program 1 times [2021-11-06 10:17:17,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:17,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738772270] [2021-11-06 10:17:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:17,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:18,515 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:17:18,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:18,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738772270] [2021-11-06 10:17:18,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738772270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:18,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:18,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:17:18,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649228448] [2021-11-06 10:17:18,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:17:18,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:17:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:17:18,517 INFO L87 Difference]: Start difference. First operand 745 states and 898 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:24,876 INFO L93 Difference]: Finished difference Result 1562 states and 1884 transitions. [2021-11-06 10:17:24,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:17:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-06 10:17:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:24,880 INFO L225 Difference]: With dead ends: 1562 [2021-11-06 10:17:24,880 INFO L226 Difference]: Without dead ends: 1427 [2021-11-06 10:17:24,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:17:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2021-11-06 10:17:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 745. [2021-11-06 10:17:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 730 states have (on average 1.2301369863013698) internal successors, (898), 744 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 898 transitions. [2021-11-06 10:17:24,910 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 898 transitions. Word has length 89 [2021-11-06 10:17:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:24,910 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 898 transitions. [2021-11-06 10:17:24,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 898 transitions. [2021-11-06 10:17:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 10:17:24,911 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:24,911 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:24,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:17:24,911 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:17:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1736920084, now seen corresponding path program 1 times [2021-11-06 10:17:24,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:24,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988313367] [2021-11-06 10:17:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:24,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:27,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:27,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988313367] [2021-11-06 10:17:27,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988313367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:27,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:27,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:17:27,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857259121] [2021-11-06 10:17:27,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:17:27,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:27,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:17:27,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:17:27,016 INFO L87 Difference]: Start difference. First operand 745 states and 898 transitions. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:46,062 INFO L93 Difference]: Finished difference Result 2586 states and 3057 transitions. [2021-11-06 10:17:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-06 10:17:46,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-06 10:17:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:46,068 INFO L225 Difference]: With dead ends: 2586 [2021-11-06 10:17:46,068 INFO L226 Difference]: Without dead ends: 2476 [2021-11-06 10:17:46,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=519, Invalid=1373, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 10:17:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2021-11-06 10:17:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 788. [2021-11-06 10:17:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 773 states have (on average 1.2238033635187582) internal successors, (946), 787 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 946 transitions. [2021-11-06 10:17:46,104 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 946 transitions. Word has length 89 [2021-11-06 10:17:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:46,104 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 946 transitions. [2021-11-06 10:17:46,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 946 transitions. [2021-11-06 10:17:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 10:17:46,106 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:46,106 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:46,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:17:46,106 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:17:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash -782979926, now seen corresponding path program 1 times [2021-11-06 10:17:46,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:46,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928356009] [2021-11-06 10:17:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:46,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:01,083 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:18:01,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:01,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928356009] [2021-11-06 10:18:01,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928356009] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:01,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:01,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-06 10:18:01,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175293917] [2021-11-06 10:18:01,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-06 10:18:01,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-06 10:18:01,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:18:01,085 INFO L87 Difference]: Start difference. First operand 788 states and 946 transitions. Second operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:32,552 INFO L93 Difference]: Finished difference Result 1624 states and 1934 transitions. [2021-11-06 10:18:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-06 10:18:32,553 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-06 10:18:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:32,557 INFO L225 Difference]: With dead ends: 1624 [2021-11-06 10:18:32,557 INFO L226 Difference]: Without dead ends: 1622 [2021-11-06 10:18:32,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=482, Invalid=1588, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 10:18:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2021-11-06 10:18:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1027. [2021-11-06 10:18:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1012 states have (on average 1.2203557312252964) internal successors, (1235), 1026 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1235 transitions. [2021-11-06 10:18:32,617 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1235 transitions. Word has length 89 [2021-11-06 10:18:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:32,617 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1235 transitions. [2021-11-06 10:18:32,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1235 transitions. [2021-11-06 10:18:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:18:32,619 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:32,619 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:32,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:18:32,619 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:18:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2015644358, now seen corresponding path program 1 times [2021-11-06 10:18:32,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:32,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689334624] [2021-11-06 10:18:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:32,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:52,005 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:18:52,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:52,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689334624] [2021-11-06 10:18:52,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689334624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:52,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:52,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-11-06 10:18:52,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122070375] [2021-11-06 10:18:52,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 10:18:52,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:52,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 10:18:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2021-11-06 10:18:52,025 INFO L87 Difference]: Start difference. First operand 1027 states and 1235 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 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:19:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:37,775 INFO L93 Difference]: Finished difference Result 1764 states and 2097 transitions. [2021-11-06 10:19:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-06 10:19:37,776 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-06 10:19:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:37,780 INFO L225 Difference]: With dead ends: 1764 [2021-11-06 10:19:37,780 INFO L226 Difference]: Without dead ends: 1762 [2021-11-06 10:19:37,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=782, Invalid=2410, Unknown=0, NotChecked=0, Total=3192 [2021-11-06 10:19:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2021-11-06 10:19:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 883. [2021-11-06 10:19:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 868 states have (on average 1.2188940092165899) internal successors, (1058), 882 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1058 transitions. [2021-11-06 10:19:37,835 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1058 transitions. Word has length 92 [2021-11-06 10:19:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:37,835 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1058 transitions. [2021-11-06 10:19:37,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 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:19:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1058 transitions. [2021-11-06 10:19:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:19:37,837 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:37,837 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:37,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:19:37,837 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:19:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash 202575411, now seen corresponding path program 1 times [2021-11-06 10:19:37,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:37,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145945706] [2021-11-06 10:19:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:37,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:37,973 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:19:37,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:37,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145945706] [2021-11-06 10:19:37,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145945706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:37,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:37,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:19:37,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631511158] [2021-11-06 10:19:37,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:19:37,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:19:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:19:37,975 INFO L87 Difference]: Start difference. First operand 883 states and 1058 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:38,243 INFO L93 Difference]: Finished difference Result 1822 states and 2162 transitions. [2021-11-06 10:19:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:19:38,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:19:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:38,245 INFO L225 Difference]: With dead ends: 1822 [2021-11-06 10:19:38,245 INFO L226 Difference]: Without dead ends: 956 [2021-11-06 10:19:38,246 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:19:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-11-06 10:19:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 867. [2021-11-06 10:19:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 852 states have (on average 1.193661971830986) internal successors, (1017), 866 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1017 transitions. [2021-11-06 10:19:38,284 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1017 transitions. Word has length 93 [2021-11-06 10:19:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:38,284 INFO L470 AbstractCegarLoop]: Abstraction has 867 states and 1017 transitions. [2021-11-06 10:19:38,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1017 transitions. [2021-11-06 10:19:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:19:38,285 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:38,285 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:38,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:19:38,285 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:19:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash -150512971, now seen corresponding path program 1 times [2021-11-06 10:19:38,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:38,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657031766] [2021-11-06 10:19:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:38,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:44,132 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:19:44,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:44,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657031766] [2021-11-06 10:19:44,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657031766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:44,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:44,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:19:44,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781571655] [2021-11-06 10:19:44,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:19:44,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:44,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:19:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:19:44,133 INFO L87 Difference]: Start difference. First operand 867 states and 1017 transitions. Second operand has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:07,309 INFO L93 Difference]: Finished difference Result 2015 states and 2346 transitions. [2021-11-06 10:20:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-06 10:20:07,309 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:20:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:07,313 INFO L225 Difference]: With dead ends: 2015 [2021-11-06 10:20:07,313 INFO L226 Difference]: Without dead ends: 1574 [2021-11-06 10:20:07,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=671, Invalid=1779, Unknown=0, NotChecked=0, Total=2450 [2021-11-06 10:20:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2021-11-06 10:20:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 877. [2021-11-06 10:20:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 862 states have (on average 1.1902552204176333) internal successors, (1026), 876 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1026 transitions. [2021-11-06 10:20:07,356 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1026 transitions. Word has length 93 [2021-11-06 10:20:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:07,356 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1026 transitions. [2021-11-06 10:20:07,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1026 transitions. [2021-11-06 10:20:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:20:07,357 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:07,357 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:20:07,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:20:07,357 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:20:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1583523153, now seen corresponding path program 1 times [2021-11-06 10:20:07,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:07,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558949963] [2021-11-06 10:20:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:07,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:08,342 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:20:08,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:08,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558949963] [2021-11-06 10:20:08,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558949963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:08,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:08,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:20:08,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962300700] [2021-11-06 10:20:08,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:20:08,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:08,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:20:08,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:20:08,343 INFO L87 Difference]: Start difference. First operand 877 states and 1026 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:22,559 INFO L93 Difference]: Finished difference Result 1643 states and 1909 transitions. [2021-11-06 10:20:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 10:20:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:20:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:22,563 INFO L225 Difference]: With dead ends: 1643 [2021-11-06 10:20:22,563 INFO L226 Difference]: Without dead ends: 1438 [2021-11-06 10:20:22,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:20:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2021-11-06 10:20:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 982. [2021-11-06 10:20:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 967 states have (on average 1.1830403309203723) internal successors, (1144), 981 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1144 transitions. [2021-11-06 10:20:22,614 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1144 transitions. Word has length 93 [2021-11-06 10:20:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:22,615 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1144 transitions. [2021-11-06 10:20:22,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1144 transitions. [2021-11-06 10:20:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:20:22,620 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:22,620 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:20:22,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:20:22,620 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:20:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -903464783, now seen corresponding path program 1 times [2021-11-06 10:20:22,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:22,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011662170] [2021-11-06 10:20:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:22,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:22,963 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:20:22,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:22,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011662170] [2021-11-06 10:20:22,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011662170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:22,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:22,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:20:22,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261191069] [2021-11-06 10:20:22,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:20:22,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:22,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:20:22,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:20:22,964 INFO L87 Difference]: Start difference. First operand 982 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:25,680 INFO L93 Difference]: Finished difference Result 1455 states and 1699 transitions. [2021-11-06 10:20:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:20:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:20:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:25,683 INFO L225 Difference]: With dead ends: 1455 [2021-11-06 10:20:25,683 INFO L226 Difference]: Without dead ends: 1079 [2021-11-06 10:20:25,684 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:20:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-11-06 10:20:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 964. [2021-11-06 10:20:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 949 states have (on average 1.1707060063224446) internal successors, (1111), 963 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1111 transitions. [2021-11-06 10:20:25,767 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1111 transitions. Word has length 93 [2021-11-06 10:20:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:25,767 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1111 transitions. [2021-11-06 10:20:25,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1111 transitions. [2021-11-06 10:20:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:20:25,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:25,768 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:20:25,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:20:25,769 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:20:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1159876431, now seen corresponding path program 1 times [2021-11-06 10:20:25,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:25,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502490509] [2021-11-06 10:20:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:25,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:27,140 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:20:27,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:27,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502490509] [2021-11-06 10:20:27,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502490509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:27,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:27,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:20:27,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528376209] [2021-11-06 10:20:27,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:20:27,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:27,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:20:27,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:20:27,141 INFO L87 Difference]: Start difference. First operand 964 states and 1111 transitions. Second operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:38,693 INFO L93 Difference]: Finished difference Result 1822 states and 2092 transitions. [2021-11-06 10:20:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:20:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:20:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:38,696 INFO L225 Difference]: With dead ends: 1822 [2021-11-06 10:20:38,696 INFO L226 Difference]: Without dead ends: 1364 [2021-11-06 10:20:38,697 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:20:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-11-06 10:20:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1073. [2021-11-06 10:20:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1058 states have (on average 1.166351606805293) internal successors, (1234), 1072 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1234 transitions. [2021-11-06 10:20:38,753 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1234 transitions. Word has length 93 [2021-11-06 10:20:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:38,754 INFO L470 AbstractCegarLoop]: Abstraction has 1073 states and 1234 transitions. [2021-11-06 10:20:38,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1234 transitions. [2021-11-06 10:20:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:20:38,755 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:38,755 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:20:38,755 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:20:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1082975633, now seen corresponding path program 1 times [2021-11-06 10:20:38,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:38,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074560645] [2021-11-06 10:20:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:38,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:43,628 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:20:43,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:43,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074560645] [2021-11-06 10:20:43,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074560645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:43,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:43,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-06 10:20:43,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002029949] [2021-11-06 10:20:43,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-06 10:20:43,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-06 10:20:43,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:20:43,630 INFO L87 Difference]: Start difference. First operand 1073 states and 1234 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:11,321 INFO L93 Difference]: Finished difference Result 1593 states and 1804 transitions. [2021-11-06 10:21:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-06 10:21:11,321 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:21:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:11,325 INFO L225 Difference]: With dead ends: 1593 [2021-11-06 10:21:11,325 INFO L226 Difference]: Without dead ends: 1353 [2021-11-06 10:21:11,326 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=860, Invalid=2332, Unknown=0, NotChecked=0, Total=3192 [2021-11-06 10:21:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2021-11-06 10:21:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1068. [2021-11-06 10:21:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1053 states have (on average 1.1595441595441596) internal successors, (1221), 1067 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1221 transitions. [2021-11-06 10:21:11,387 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1221 transitions. Word has length 93 [2021-11-06 10:21:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:11,387 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1221 transitions. [2021-11-06 10:21:11,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1221 transitions. [2021-11-06 10:21:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:21:11,388 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:11,388 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:21:11,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:21:11,388 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:21:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -230228118, now seen corresponding path program 1 times [2021-11-06 10:21:11,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:11,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796155322] [2021-11-06 10:21:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:11,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:11,730 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:21:11,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:11,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796155322] [2021-11-06 10:21:11,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796155322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:11,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:11,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:21:11,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882670100] [2021-11-06 10:21:11,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:21:11,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:21:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:21:11,733 INFO L87 Difference]: Start difference. First operand 1068 states and 1221 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:12,658 INFO L93 Difference]: Finished difference Result 1279 states and 1461 transitions. [2021-11-06 10:21:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:21:12,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 10:21:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:12,661 INFO L225 Difference]: With dead ends: 1279 [2021-11-06 10:21:12,661 INFO L226 Difference]: Without dead ends: 1273 [2021-11-06 10:21:12,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:21:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2021-11-06 10:21:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1095. [2021-11-06 10:21:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1080 states have (on average 1.151851851851852) internal successors, (1244), 1094 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1244 transitions. [2021-11-06 10:21:12,726 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1244 transitions. Word has length 95 [2021-11-06 10:21:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:12,727 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 1244 transitions. [2021-11-06 10:21:12,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1244 transitions. [2021-11-06 10:21:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:21:12,728 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:12,728 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:21:12,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:21:12,730 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:21:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1039574744, now seen corresponding path program 1 times [2021-11-06 10:21:12,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:12,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698029994] [2021-11-06 10:21:12,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:12,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:13,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:21:13,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:13,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698029994] [2021-11-06 10:21:13,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698029994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:13,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:13,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:21:13,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412405931] [2021-11-06 10:21:13,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:21:13,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:13,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:21:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:21:13,827 INFO L87 Difference]: Start difference. First operand 1095 states and 1244 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:34,841 INFO L93 Difference]: Finished difference Result 1689 states and 1899 transitions. [2021-11-06 10:21:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-06 10:21:34,842 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 10:21:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:34,845 INFO L225 Difference]: With dead ends: 1689 [2021-11-06 10:21:34,845 INFO L226 Difference]: Without dead ends: 1472 [2021-11-06 10:21:34,849 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2021-11-06 10:21:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2021-11-06 10:21:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1090. [2021-11-06 10:21:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1075 states have (on average 1.1469767441860466) internal successors, (1233), 1089 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1233 transitions. [2021-11-06 10:21:34,917 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1233 transitions. Word has length 95 [2021-11-06 10:21:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:34,918 INFO L470 AbstractCegarLoop]: Abstraction has 1090 states and 1233 transitions. [2021-11-06 10:21:34,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1233 transitions. [2021-11-06 10:21:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:21:34,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:34,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:21:34,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:21:34,919 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:21:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1049745176, now seen corresponding path program 1 times [2021-11-06 10:21:34,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:34,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162275970] [2021-11-06 10:21:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:34,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:21:38,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:38,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162275970] [2021-11-06 10:21:38,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162275970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:38,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:38,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:21:38,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106092436] [2021-11-06 10:21:38,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:21:38,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:21:38,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:21:38,224 INFO L87 Difference]: Start difference. First operand 1090 states and 1233 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:57,364 INFO L93 Difference]: Finished difference Result 1612 states and 1800 transitions. [2021-11-06 10:21:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-06 10:21:57,365 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 10:21:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:57,383 INFO L225 Difference]: With dead ends: 1612 [2021-11-06 10:21:57,383 INFO L226 Difference]: Without dead ends: 1608 [2021-11-06 10:21:57,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=963, Invalid=3867, Unknown=0, NotChecked=0, Total=4830 [2021-11-06 10:21:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2021-11-06 10:21:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1088. [2021-11-06 10:21:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1074 states have (on average 1.1424581005586592) internal successors, (1227), 1087 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1227 transitions. [2021-11-06 10:21:57,458 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1227 transitions. Word has length 95 [2021-11-06 10:21:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:57,458 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 1227 transitions. [2021-11-06 10:21:57,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1227 transitions. [2021-11-06 10:21:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:21:57,459 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:57,460 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:21:57,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:21:57,460 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:21:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash -747514910, now seen corresponding path program 1 times [2021-11-06 10:21:57,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:57,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510517626] [2021-11-06 10:21:57,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:57,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 10:22:03,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:03,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510517626] [2021-11-06 10:22:03,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510517626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:03,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:03,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:22:03,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301982978] [2021-11-06 10:22:03,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:22:03,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:22:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:22:03,995 INFO L87 Difference]: Start difference. First operand 1088 states and 1227 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:07,148 INFO L93 Difference]: Finished difference Result 2026 states and 2282 transitions. [2021-11-06 10:22:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:22:07,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 10:22:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:07,151 INFO L225 Difference]: With dead ends: 2026 [2021-11-06 10:22:07,151 INFO L226 Difference]: Without dead ends: 1347 [2021-11-06 10:22:07,152 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:22:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2021-11-06 10:22:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1308. [2021-11-06 10:22:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1294 states have (on average 1.1391035548686244) internal successors, (1474), 1307 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1474 transitions. [2021-11-06 10:22:07,240 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1474 transitions. Word has length 99 [2021-11-06 10:22:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:07,241 INFO L470 AbstractCegarLoop]: Abstraction has 1308 states and 1474 transitions. [2021-11-06 10:22:07,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1474 transitions. [2021-11-06 10:22:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:22:07,242 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:07,243 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:22:07,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 10:22:07,243 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:22:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2027609737, now seen corresponding path program 1 times [2021-11-06 10:22:07,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:07,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426357134] [2021-11-06 10:22:07,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:07,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:07,587 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:22:07,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:07,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426357134] [2021-11-06 10:22:07,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426357134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:07,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:07,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:22:07,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547175386] [2021-11-06 10:22:07,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:22:07,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:22:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:22:07,589 INFO L87 Difference]: Start difference. First operand 1308 states and 1474 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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:22:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:08,275 INFO L93 Difference]: Finished difference Result 1838 states and 2058 transitions. [2021-11-06 10:22:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:22:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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:22:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:08,278 INFO L225 Difference]: With dead ends: 1838 [2021-11-06 10:22:08,278 INFO L226 Difference]: Without dead ends: 1834 [2021-11-06 10:22:08,279 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:22:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2021-11-06 10:22:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1352. [2021-11-06 10:22:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1338 states have (on average 1.1345291479820627) internal successors, (1518), 1351 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1518 transitions. [2021-11-06 10:22:08,400 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1518 transitions. Word has length 102 [2021-11-06 10:22:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:08,401 INFO L470 AbstractCegarLoop]: Abstraction has 1352 states and 1518 transitions. [2021-11-06 10:22:08,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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:22:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1518 transitions. [2021-11-06 10:22:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:22:08,402 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:08,403 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, 1, 1, 1] [2021-11-06 10:22:08,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 10:22:08,403 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:22:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1534894162, now seen corresponding path program 1 times [2021-11-06 10:22:08,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:08,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137276716] [2021-11-06 10:22:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:08,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:18,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:18,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137276716] [2021-11-06 10:22:18,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137276716] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:22:18,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102650663] [2021-11-06 10:22:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:18,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:22:18,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:22:18,353 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:22:18,358 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:22:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:19,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 3142 conjuncts, 114 conjunts are in the unsatisfiable core [2021-11-06 10:22:19,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:22:19,805 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:22:20,069 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 10:22:20,069 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:22:20,217 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:22:22,634 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-06 10:22:22,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 41 [2021-11-06 10:22:23,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-06 10:22:23,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:22:23,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2021-11-06 10:22:32,201 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-06 10:22:32,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 200 [2021-11-06 10:22:32,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:22:32,327 INFO L354 Elim1Store]: treesize reduction 262, result has 12.4 percent of original size [2021-11-06 10:22:32,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 138 [2021-11-06 10:22:32,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 183 treesize of output 159 [2021-11-06 10:22:32,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 37 [2021-11-06 10:22:32,696 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-06 10:22:32,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 54 [2021-11-06 10:22:33,661 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-06 10:22:33,662 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 78 treesize of output 44 [2021-11-06 10:22:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:33,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102650663] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:22:33,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 10:22:33,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 41 [2021-11-06 10:22:33,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208976790] [2021-11-06 10:22:33,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-06 10:22:33,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-06 10:22:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2021-11-06 10:22:33,824 INFO L87 Difference]: Start difference. First operand 1352 states and 1518 transitions. Second operand has 41 states, 41 states have (on average 4.7317073170731705) internal successors, (194), 41 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:23:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:23:42,278 INFO L93 Difference]: Finished difference Result 1862 states and 2082 transitions. [2021-11-06 10:23:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 10:23:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.7317073170731705) internal successors, (194), 41 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) Word has length 102 [2021-11-06 10:23:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:23:42,281 INFO L225 Difference]: With dead ends: 1862 [2021-11-06 10:23:42,281 INFO L226 Difference]: Without dead ends: 1735 [2021-11-06 10:23:42,283 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=2424, Invalid=7476, Unknown=0, NotChecked=0, Total=9900 [2021-11-06 10:23:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-11-06 10:23:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1476. [2021-11-06 10:23:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1462 states have (on average 1.1415868673050615) internal successors, (1669), 1475 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1669 transitions. [2021-11-06 10:23:42,380 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1669 transitions. Word has length 102 [2021-11-06 10:23:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:23:42,381 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 1669 transitions. [2021-11-06 10:23:42,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.7317073170731705) internal successors, (194), 41 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:23:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1669 transitions. [2021-11-06 10:23:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:23:42,382 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:23:42,382 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, 1, 1, 1] [2021-11-06 10:23:42,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 10:23:42,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-06 10:23:42,596 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:23:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:23:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1702235056, now seen corresponding path program 1 times [2021-11-06 10:23:42,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:23:42,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069545654] [2021-11-06 10:23:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:23:42,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:23:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:23:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 10:23:44,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:23:44,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069545654] [2021-11-06 10:23:44,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069545654] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:23:44,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:23:44,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:23:44,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794163352] [2021-11-06 10:23:44,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:23:44,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:23:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:23:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:23:44,596 INFO L87 Difference]: Start difference. First operand 1476 states and 1669 transitions. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 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:23:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:23:58,382 INFO L93 Difference]: Finished difference Result 2093 states and 2356 transitions. [2021-11-06 10:23:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:23:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 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 102 [2021-11-06 10:23:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:23:58,384 INFO L225 Difference]: With dead ends: 2093 [2021-11-06 10:23:58,385 INFO L226 Difference]: Without dead ends: 1523 [2021-11-06 10:23:58,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:23:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2021-11-06 10:23:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1345. [2021-11-06 10:23:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1331 states have (on average 1.1427498121712998) internal successors, (1521), 1344 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1521 transitions. [2021-11-06 10:23:58,468 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1521 transitions. Word has length 102 [2021-11-06 10:23:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:23:58,468 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 1521 transitions. [2021-11-06 10:23:58,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 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:23:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1521 transitions. [2021-11-06 10:23:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:23:58,477 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:23:58,478 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, 1, 1, 1] [2021-11-06 10:23:58,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 10:23:58,478 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:23:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:23:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2125881778, now seen corresponding path program 1 times [2021-11-06 10:23:58,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:23:58,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724726770] [2021-11-06 10:23:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:23:58,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:24:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:24:06,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:24:06,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724726770] [2021-11-06 10:24:06,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724726770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:24:06,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630134241] [2021-11-06 10:24:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:24:06,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:24:06,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:24:06,506 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:24:06,506 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:24:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:07,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-06 10:24:07,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:24:07,886 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:24:08,351 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 10:24:08,352 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:24:08,501 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:24:09,480 INFO L354 Elim1Store]: treesize reduction 24, result has 54.7 percent of original size [2021-11-06 10:24:09,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 45 [2021-11-06 10:24:10,450 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-06 10:24:10,450 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 77 treesize of output 55 [2021-11-06 10:24:14,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 203 treesize of output 179 [2021-11-06 10:24:14,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 179 treesize of output 155 [2021-11-06 10:24:14,501 INFO L354 Elim1Store]: treesize reduction 214, result has 14.7 percent of original size [2021-11-06 10:24:14,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 155 treesize of output 126 [2021-11-06 10:24:14,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 39 [2021-11-06 10:24:14,759 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-06 10:24:14,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 54 [2021-11-06 10:24:15,650 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-06 10:24:15,650 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 78 treesize of output 44 [2021-11-06 10:24:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:24:15,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630134241] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:24:15,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 10:24:15,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2021-11-06 10:24:15,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803653289] [2021-11-06 10:24:15,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-06 10:24:15,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:24:15,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-06 10:24:15,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-11-06 10:24:15,743 INFO L87 Difference]: Start difference. First operand 1345 states and 1521 transitions. Second operand has 28 states, 28 states have (on average 7.25) internal successors, (203), 28 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:24:27,994 INFO L93 Difference]: Finished difference Result 1695 states and 1913 transitions. [2021-11-06 10:24:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:24:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.25) internal successors, (203), 28 states have internal predecessors, (203), 0 states have call successors, (0), 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:24:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:24:27,996 INFO L225 Difference]: With dead ends: 1695 [2021-11-06 10:24:27,997 INFO L226 Difference]: Without dead ends: 1693 [2021-11-06 10:24:27,997 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2021-11-06 10:24:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2021-11-06 10:24:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1426. [2021-11-06 10:24:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1412 states have (on average 1.1466005665722379) internal successors, (1619), 1425 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1619 transitions. [2021-11-06 10:24:28,087 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1619 transitions. Word has length 102 [2021-11-06 10:24:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:24:28,087 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 1619 transitions. [2021-11-06 10:24:28,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.25) internal successors, (203), 28 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1619 transitions. [2021-11-06 10:24:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-06 10:24:28,089 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:24:28,089 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, 1, 1, 1, 1, 1, 1] [2021-11-06 10:24:28,115 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:24:28,291 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,SelfDestructingSolverStorable39 [2021-11-06 10:24:28,292 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2021-11-06 10:24:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:24:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1805074434, now seen corresponding path program 1 times [2021-11-06 10:24:28,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:24:28,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368274695] [2021-11-06 10:24:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:24:28,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:24:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:24:37,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:24:37,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368274695] [2021-11-06 10:24:37,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368274695] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 10:24:37,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370881003] [2021-11-06 10:24:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:24:37,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:24:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:24:37,245 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:24:37,246 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:24:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:38,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 101 conjunts are in the unsatisfiable core [2021-11-06 10:24:38,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:24:38,694 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:24:38,939 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 10:24:38,940 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:24:39,142 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 21 treesize of output 17 [2021-11-06 10:24:41,292 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-06 10:24:41,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 41 [2021-11-06 10:24:42,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2021-11-06 10:24:42,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-11-06 10:24:47,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:24:47,733 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 10:24:47,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 378 treesize of output 302 [2021-11-06 10:24:47,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 10:24:47,746 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 10:24:47,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 262 [2021-11-06 10:24:49,273 INFO L354 Elim1Store]: treesize reduction 926, result has 28.5 percent of original size [2021-11-06 10:24:49,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 48 case distinctions, treesize of input 262 treesize of output 519 Killed by 15