./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_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 624e111eb11fc6cb53be17248f0e61e18bd8cc958dfb511134351ecf4f085f78 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 12:30:09,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 12:30:09,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 12:30:09,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 12:30:09,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 12:30:09,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 12:30:09,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 12:30:09,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 12:30:09,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 12:30:09,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 12:30:09,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 12:30:09,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 12:30:09,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 12:30:09,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 12:30:09,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 12:30:09,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 12:30:09,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 12:30:09,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 12:30:09,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 12:30:09,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 12:30:09,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 12:30:09,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 12:30:09,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 12:30:09,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 12:30:09,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 12:30:09,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 12:30:09,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 12:30:09,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 12:30:09,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 12:30:09,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 12:30:09,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 12:30:09,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 12:30:09,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 12:30:09,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 12:30:09,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 12:30:09,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 12:30:09,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 12:30:09,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 12:30:09,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 12:30:09,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 12:30:09,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 12:30:09,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 12:30:09,676 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 12:30:09,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 12:30:09,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 12:30:09,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 12:30:09,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 12:30:09,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 12:30:09,680 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 12:30:09,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 12:30:09,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 12:30:09,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 12:30:09,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 12:30:09,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 12:30:09,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 12:30:09,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 12:30:09,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 12:30:09,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 12:30:09,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 12:30:09,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 12:30:09,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 12:30:09,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:30:09,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 12:30:09,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 12:30:09,684 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 12:30:09,684 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 -> 624e111eb11fc6cb53be17248f0e61e18bd8cc958dfb511134351ecf4f085f78 [2021-11-05 12:30:09,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 12:30:09,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 12:30:09,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 12:30:09,993 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 12:30:09,993 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 12:30:09,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i [2021-11-05 12:30:10,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a22f28b/39390724680a4a70802f3904f2a0a20e/FLAG2c74b8337 [2021-11-05 12:30:10,635 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 12:30:10,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i [2021-11-05 12:30:10,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a22f28b/39390724680a4a70802f3904f2a0a20e/FLAG2c74b8337 [2021-11-05 12:30:11,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a22f28b/39390724680a4a70802f3904f2a0a20e [2021-11-05 12:30:11,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 12:30:11,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 12:30:11,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 12:30:11,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 12:30:11,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 12:30:11,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:30:11" (1/1) ... [2021-11-05 12:30:11,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109f45d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:11, skipping insertion in model container [2021-11-05 12:30:11,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:30:11" (1/1) ... [2021-11-05 12:30:11,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 12:30:11,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 12:30:11,357 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4495,4508] [2021-11-05 12:30:11,363 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4555,4568] [2021-11-05 12:30:11,379 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:30:11,385 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:30:11,881 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,882 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,895 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,895 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,898 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:11,898 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,134 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:30:12,134 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:30:12,135 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:30:12,136 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:30:12,136 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:30:12,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:30:12,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:30:12,141 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:30:12,142 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:30:12,143 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:30:12,224 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:30:12,285 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,286 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:30:12,375 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 12:30:12,384 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4495,4508] [2021-11-05 12:30:12,387 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4555,4568] [2021-11-05 12:30:12,390 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:30:12,397 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:30:12,417 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,417 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,418 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,418 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,418 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,422 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,422 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,423 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,423 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,444 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:30:12,445 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:30:12,445 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:30:12,446 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:30:12,446 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:30:12,459 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:30:12,459 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:30:12,460 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:30:12,460 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:30:12,460 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:30:12,482 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:30:12,531 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,531 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:30:12,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:30:12,755 INFO L208 MainTranslator]: Completed translation [2021-11-05 12:30:12,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12 WrapperNode [2021-11-05 12:30:12,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 12:30:12,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 12:30:12,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 12:30:12,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 12:30:12,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:12,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:12,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 12:30:12,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 12:30:12,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 12:30:12,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 12:30:12,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:12,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:12,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:12,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:13,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:13,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:13,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:13,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 12:30:13,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 12:30:13,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 12:30:13,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 12:30:13,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (1/1) ... [2021-11-05 12:30:13,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:30:13,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:30:13,074 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-05 12:30:13,080 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-05 12:30:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 12:30:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 12:30:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 12:30:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 12:30:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 12:30:13,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 12:30:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 12:30:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 12:30:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 12:30:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 12:30:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 12:30:20,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 12:30:20,396 INFO L299 CfgBuilder]: Removed 87 assume(true) statements. [2021-11-05 12:30:20,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:30:20 BoogieIcfgContainer [2021-11-05 12:30:20,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 12:30:20,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 12:30:20,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 12:30:20,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 12:30:20,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 12:30:11" (1/3) ... [2021-11-05 12:30:20,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49697969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:30:20, skipping insertion in model container [2021-11-05 12:30:20,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:30:12" (2/3) ... [2021-11-05 12:30:20,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49697969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:30:20, skipping insertion in model container [2021-11-05 12:30:20,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:30:20" (3/3) ... [2021-11-05 12:30:20,403 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_write_u8_harness.i [2021-11-05 12:30:20,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 12:30:20,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-05 12:30:20,446 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 12:30:20,450 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-05 12:30:20,450 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-05 12:30:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 173 states have (on average 1.4855491329479769) internal successors, (257), 184 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-05 12:30:20,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:20,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:30:20,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash -27136647, now seen corresponding path program 1 times [2021-11-05 12:30:20,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:20,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126999009] [2021-11-05 12:30:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:20,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:20,919 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-05 12:30:20,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:20,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126999009] [2021-11-05 12:30:20,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126999009] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:20,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:20,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 12:30:20,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477000414] [2021-11-05 12:30:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:20,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 12:30:20,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:20,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 12:30:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:30:20,946 INFO L87 Difference]: Start difference. First operand has 185 states, 173 states have (on average 1.4855491329479769) internal successors, (257), 184 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:20,987 INFO L93 Difference]: Finished difference Result 366 states and 509 transitions. [2021-11-05 12:30:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 12:30:20,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-05 12:30:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:20,998 INFO L225 Difference]: With dead ends: 366 [2021-11-05 12:30:20,999 INFO L226 Difference]: Without dead ends: 180 [2021-11-05 12:30:21,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:30:21,012 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:21,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 12:30:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-05 12:30:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-11-05 12:30:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 169 states have (on average 1.3609467455621302) internal successors, (230), 179 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 230 transitions. [2021-11-05 12:30:21,047 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 230 transitions. Word has length 38 [2021-11-05 12:30:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:21,048 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 230 transitions. [2021-11-05 12:30:21,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2021-11-05 12:30:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-05 12:30:21,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:21,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:30:21,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 12:30:21,054 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2001073661, now seen corresponding path program 1 times [2021-11-05 12:30:21,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:21,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601972292] [2021-11-05 12:30:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:21,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:30:21,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:21,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601972292] [2021-11-05 12:30:21,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601972292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:21,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:21,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:30:21,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435189037] [2021-11-05 12:30:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:21,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:30:21,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:30:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:30:21,334 INFO L87 Difference]: Start difference. First operand 180 states and 230 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:21,543 INFO L93 Difference]: Finished difference Result 334 states and 426 transitions. [2021-11-05 12:30:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:30:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-05 12:30:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:21,544 INFO L225 Difference]: With dead ends: 334 [2021-11-05 12:30:21,545 INFO L226 Difference]: Without dead ends: 180 [2021-11-05 12:30:21,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.37ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:30:21,546 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 321 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.84ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 162.39ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:21,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 308 Invalid, 43 Unknown, 0 Unchecked, 3.84ms Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 162.39ms Time] [2021-11-05 12:30:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-05 12:30:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-11-05 12:30:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 179 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 227 transitions. [2021-11-05 12:30:21,553 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 227 transitions. Word has length 38 [2021-11-05 12:30:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:21,553 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 227 transitions. [2021-11-05 12:30:21,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2021-11-05 12:30:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-05 12:30:21,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:21,555 INFO L514 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] [2021-11-05 12:30:21,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 12:30:21,555 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -58490273, now seen corresponding path program 1 times [2021-11-05 12:30:21,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:21,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766558488] [2021-11-05 12:30:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:21,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:30:21,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:21,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766558488] [2021-11-05 12:30:21,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766558488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:21,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:21,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:30:21,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056299254] [2021-11-05 12:30:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:21,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:30:21,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:30:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:30:21,788 INFO L87 Difference]: Start difference. First operand 180 states and 227 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:22,206 INFO L93 Difference]: Finished difference Result 395 states and 506 transitions. [2021-11-05 12:30:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:30:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-05 12:30:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:22,208 INFO L225 Difference]: With dead ends: 395 [2021-11-05 12:30:22,208 INFO L226 Difference]: Without dead ends: 240 [2021-11-05 12:30:22,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:30:22,210 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 129 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 340.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.86ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 377.81ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:22,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 610 Invalid, 122 Unknown, 0 Unchecked, 3.86ms Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 377.81ms Time] [2021-11-05 12:30:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-05 12:30:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2021-11-05 12:30:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 181 states have (on average 1.3204419889502763) internal successors, (239), 191 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2021-11-05 12:30:22,228 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 50 [2021-11-05 12:30:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:22,228 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2021-11-05 12:30:22,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2021-11-05 12:30:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-05 12:30:22,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:22,230 INFO L514 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] [2021-11-05 12:30:22,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 12:30:22,230 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:22,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 785515229, now seen corresponding path program 1 times [2021-11-05 12:30:22,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:22,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470156944] [2021-11-05 12:30:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:22,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:22,505 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-05 12:30:22,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:22,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470156944] [2021-11-05 12:30:22,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470156944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:22,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:22,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:30:22,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393213609] [2021-11-05 12:30:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:22,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:30:22,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:30:22,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:30:22,507 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:22,741 INFO L93 Difference]: Finished difference Result 313 states and 386 transitions. [2021-11-05 12:30:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:30:22,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-05 12:30:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:22,743 INFO L225 Difference]: With dead ends: 313 [2021-11-05 12:30:22,743 INFO L226 Difference]: Without dead ends: 192 [2021-11-05 12:30:22,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 137.55ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:30:22,744 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 481 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.95ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.50ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:22,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 343 Invalid, 45 Unknown, 0 Unchecked, 1.95ms Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 135.50ms Time] [2021-11-05 12:30:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-05 12:30:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-11-05 12:30:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 181 states have (on average 1.3149171270718232) internal successors, (238), 191 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2021-11-05 12:30:22,750 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 50 [2021-11-05 12:30:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:22,750 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2021-11-05 12:30:22,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2021-11-05 12:30:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-05 12:30:22,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:22,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:30:22,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 12:30:22,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -628747704, now seen corresponding path program 1 times [2021-11-05 12:30:22,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:22,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701952366] [2021-11-05 12:30:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:22,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:23,057 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-05 12:30:23,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:23,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701952366] [2021-11-05 12:30:23,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701952366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:23,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:23,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:30:23,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312507506] [2021-11-05 12:30:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:23,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:30:23,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:23,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:30:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:30:23,060 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:23,422 INFO L93 Difference]: Finished difference Result 264 states and 319 transitions. [2021-11-05 12:30:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 12:30:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-05 12:30:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:23,423 INFO L225 Difference]: With dead ends: 264 [2021-11-05 12:30:23,423 INFO L226 Difference]: Without dead ends: 192 [2021-11-05 12:30:23,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 234.94ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:30:23,424 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 623 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.59ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 192.16ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:23,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 390 Invalid, 58 Unknown, 0 Unchecked, 2.59ms Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 192.16ms Time] [2021-11-05 12:30:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-05 12:30:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-11-05 12:30:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 181 states have (on average 1.3038674033149171) internal successors, (236), 191 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions. [2021-11-05 12:30:23,430 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 56 [2021-11-05 12:30:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:23,430 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 236 transitions. [2021-11-05 12:30:23,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions. [2021-11-05 12:30:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 12:30:23,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:23,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:30:23,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 12:30:23,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1564101757, now seen corresponding path program 1 times [2021-11-05 12:30:23,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:23,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170828372] [2021-11-05 12:30:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:23,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:23,876 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-05 12:30:23,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:23,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170828372] [2021-11-05 12:30:23,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170828372] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:23,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:23,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:30:23,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513334135] [2021-11-05 12:30:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:23,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:30:23,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:30:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:30:23,877 INFO L87 Difference]: Start difference. First operand 192 states and 236 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:24,558 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2021-11-05 12:30:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 12:30:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-05 12:30:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:24,560 INFO L225 Difference]: With dead ends: 308 [2021-11-05 12:30:24,560 INFO L226 Difference]: Without dead ends: 295 [2021-11-05 12:30:24,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 236.84ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:30:24,561 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 227 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 468.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.82ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 517.05ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:24,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 846 Invalid, 201 Unknown, 0 Unchecked, 4.82ms Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 517.05ms Time] [2021-11-05 12:30:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-05 12:30:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 198. [2021-11-05 12:30:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 187 states have (on average 1.2887700534759359) internal successors, (241), 197 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 241 transitions. [2021-11-05 12:30:24,566 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 241 transitions. Word has length 62 [2021-11-05 12:30:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:24,566 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 241 transitions. [2021-11-05 12:30:24,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 241 transitions. [2021-11-05 12:30:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 12:30:24,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:24,574 INFO L514 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] [2021-11-05 12:30:24,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 12:30:24,574 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:24,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2012168309, now seen corresponding path program 1 times [2021-11-05 12:30:24,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:24,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125171888] [2021-11-05 12:30:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:24,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:25,206 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-05 12:30:25,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:25,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125171888] [2021-11-05 12:30:25,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125171888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:25,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:25,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:30:25,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601682711] [2021-11-05 12:30:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:25,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:30:25,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:30:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:30:25,207 INFO L87 Difference]: Start difference. First operand 198 states and 241 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:27,258 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:29,352 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:31,290 INFO L93 Difference]: Finished difference Result 609 states and 756 transitions. [2021-11-05 12:30:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-05 12:30:31,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-05 12:30:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:31,292 INFO L225 Difference]: With dead ends: 609 [2021-11-05 12:30:31,292 INFO L226 Difference]: Without dead ends: 430 [2021-11-05 12:30:31,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 562.07ms TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2021-11-05 12:30:31,293 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 622 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5365.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.20ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5614.44ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:31,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [622 Valid, 1570 Invalid, 496 Unknown, 0 Unchecked, 9.20ms Time], IncrementalHoareTripleChecker [26 Valid, 468 Invalid, 2 Unknown, 0 Unchecked, 5614.44ms Time] [2021-11-05 12:30:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-05 12:30:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 213. [2021-11-05 12:30:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 202 states have (on average 1.2772277227722773) internal successors, (258), 212 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 258 transitions. [2021-11-05 12:30:31,299 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 258 transitions. Word has length 66 [2021-11-05 12:30:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:31,300 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 258 transitions. [2021-11-05 12:30:31,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 258 transitions. [2021-11-05 12:30:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 12:30:31,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:31,301 INFO L514 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] [2021-11-05 12:30:31,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 12:30:31,301 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2024633549, now seen corresponding path program 1 times [2021-11-05 12:30:31,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:31,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131798288] [2021-11-05 12:30:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:31,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:30:31,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:31,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131798288] [2021-11-05 12:30:31,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131798288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:31,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:31,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:30:31,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354117753] [2021-11-05 12:30:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:31,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:30:31,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:30:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:30:31,743 INFO L87 Difference]: Start difference. First operand 213 states and 258 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:33,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:34,892 INFO L93 Difference]: Finished difference Result 593 states and 716 transitions. [2021-11-05 12:30:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:30:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-05 12:30:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:34,894 INFO L225 Difference]: With dead ends: 593 [2021-11-05 12:30:34,894 INFO L226 Difference]: Without dead ends: 404 [2021-11-05 12:30:34,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 114.36ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:30:34,895 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 554 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2894.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.37ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3046.15ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:34,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 463 Invalid, 267 Unknown, 0 Unchecked, 4.37ms Time], IncrementalHoareTripleChecker [33 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 3046.15ms Time] [2021-11-05 12:30:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-11-05 12:30:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 233. [2021-11-05 12:30:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 232 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 278 transitions. [2021-11-05 12:30:34,905 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 278 transitions. Word has length 66 [2021-11-05 12:30:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:34,908 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 278 transitions. [2021-11-05 12:30:34,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 278 transitions. [2021-11-05 12:30:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 12:30:34,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:34,910 INFO L514 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] [2021-11-05 12:30:34,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 12:30:34,911 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1344575179, now seen corresponding path program 1 times [2021-11-05 12:30:34,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:34,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348512162] [2021-11-05 12:30:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:34,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:35,780 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-05 12:30:35,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:35,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348512162] [2021-11-05 12:30:35,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348512162] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:35,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:35,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:30:35,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766654066] [2021-11-05 12:30:35,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:35,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:30:35,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:30:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:30:35,782 INFO L87 Difference]: Start difference. First operand 233 states and 278 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:37,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:39,963 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:42,053 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:44,075 INFO L93 Difference]: Finished difference Result 504 states and 593 transitions. [2021-11-05 12:30:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 12:30:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-05 12:30:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:44,076 INFO L225 Difference]: With dead ends: 504 [2021-11-05 12:30:44,077 INFO L226 Difference]: Without dead ends: 375 [2021-11-05 12:30:44,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1010.54ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-05 12:30:44,078 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 703 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 33 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7065.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.67ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7483.60ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:44,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [703 Valid, 848 Invalid, 373 Unknown, 0 Unchecked, 4.67ms Time], IncrementalHoareTripleChecker [33 Valid, 337 Invalid, 3 Unknown, 0 Unchecked, 7483.60ms Time] [2021-11-05 12:30:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-05 12:30:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 247. [2021-11-05 12:30:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 246 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 294 transitions. [2021-11-05 12:30:44,087 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 294 transitions. Word has length 66 [2021-11-05 12:30:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:44,087 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 294 transitions. [2021-11-05 12:30:44,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 294 transitions. [2021-11-05 12:30:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 12:30:44,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:44,088 INFO L514 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] [2021-11-05 12:30:44,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 12:30:44,088 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1103878777, now seen corresponding path program 1 times [2021-11-05 12:30:44,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:44,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564375936] [2021-11-05 12:30:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:44,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:46,374 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-05 12:30:46,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:46,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564375936] [2021-11-05 12:30:46,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564375936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:46,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:46,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:30:46,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587381324] [2021-11-05 12:30:46,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:46,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:30:46,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:30:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:30:46,376 INFO L87 Difference]: Start difference. First operand 247 states and 294 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:48,423 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:50,081 INFO L93 Difference]: Finished difference Result 679 states and 809 transitions. [2021-11-05 12:30:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-05 12:30:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-05 12:30:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:50,083 INFO L225 Difference]: With dead ends: 679 [2021-11-05 12:30:50,083 INFO L226 Difference]: Without dead ends: 464 [2021-11-05 12:30:50,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 675.70ms TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-11-05 12:30:50,084 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 845 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3015.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.24ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3212.58ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:50,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [845 Valid, 1315 Invalid, 418 Unknown, 0 Unchecked, 5.24ms Time], IncrementalHoareTripleChecker [28 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 3212.58ms Time] [2021-11-05 12:30:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-11-05 12:30:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 250. [2021-11-05 12:30:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2468619246861925) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2021-11-05 12:30:50,090 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 66 [2021-11-05 12:30:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:50,091 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2021-11-05 12:30:50,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2021-11-05 12:30:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-05 12:30:50,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:50,095 INFO L514 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] [2021-11-05 12:30:50,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 12:30:50,095 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -598346, now seen corresponding path program 1 times [2021-11-05 12:30:50,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:50,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131714331] [2021-11-05 12:30:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:50,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:50,593 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-05 12:30:50,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:50,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131714331] [2021-11-05 12:30:50,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131714331] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:50,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:50,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:30:50,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822703517] [2021-11-05 12:30:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:50,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:30:50,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:50,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:30:50,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:30:50,594 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:51,347 INFO L93 Difference]: Finished difference Result 549 states and 642 transitions. [2021-11-05 12:30:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 12:30:51,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-11-05 12:30:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:51,349 INFO L225 Difference]: With dead ends: 549 [2021-11-05 12:30:51,349 INFO L226 Difference]: Without dead ends: 313 [2021-11-05 12:30:51,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 207.44ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:30:51,350 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 119 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 586.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.70ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 631.10ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:51,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 1334 Invalid, 265 Unknown, 0 Unchecked, 2.70ms Time], IncrementalHoareTripleChecker [36 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 631.10ms Time] [2021-11-05 12:30:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-11-05 12:30:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 250. [2021-11-05 12:30:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2301255230125523) internal successors, (294), 249 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 294 transitions. [2021-11-05 12:30:51,358 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 294 transitions. Word has length 73 [2021-11-05 12:30:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:51,358 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 294 transitions. [2021-11-05 12:30:51,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 294 transitions. [2021-11-05 12:30:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:30:51,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:51,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:30:51,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 12:30:51,360 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:51,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1926399951, now seen corresponding path program 1 times [2021-11-05 12:30:51,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:51,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134008189] [2021-11-05 12:30:51,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:51,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:51,522 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-05 12:30:51,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:51,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134008189] [2021-11-05 12:30:51,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134008189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:51,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:51,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:30:51,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442899057] [2021-11-05 12:30:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:51,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:30:51,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:30:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:30:51,524 INFO L87 Difference]: Start difference. First operand 250 states and 294 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:30:51,796 INFO L93 Difference]: Finished difference Result 500 states and 586 transitions. [2021-11-05 12:30:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:30:51,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:30:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:30:51,798 INFO L225 Difference]: With dead ends: 500 [2021-11-05 12:30:51,798 INFO L226 Difference]: Without dead ends: 255 [2021-11-05 12:30:51,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.78ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:30:51,799 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 30 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 222.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.89ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 239.64ms IncrementalHoareTripleChecker+Time [2021-11-05 12:30:51,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 573 Invalid, 103 Unknown, 0 Unchecked, 0.89ms Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 239.64ms Time] [2021-11-05 12:30:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-05 12:30:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2021-11-05 12:30:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 226 states have (on average 1.1902654867256637) internal successors, (269), 236 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 269 transitions. [2021-11-05 12:30:51,807 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 269 transitions. Word has length 75 [2021-11-05 12:30:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:30:51,807 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 269 transitions. [2021-11-05 12:30:51,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 269 transitions. [2021-11-05 12:30:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:30:51,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:30:51,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:30:51,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 12:30:51,809 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:30:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:30:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1786922349, now seen corresponding path program 1 times [2021-11-05 12:30:51,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:30:51,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718169648] [2021-11-05 12:30:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:30:51,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:30:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:30:53,166 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-05 12:30:53,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:30:53,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718169648] [2021-11-05 12:30:53,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718169648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:30:53,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:30:53,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-05 12:30:53,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827578292] [2021-11-05 12:30:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:30:53,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-05 12:30:53,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:30:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-05 12:30:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-05 12:30:53,168 INFO L87 Difference]: Start difference. First operand 237 states and 269 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:30:55,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:57,329 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:30:59,438 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:01,559 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:03,694 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:05,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:07,935 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:10,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:31:17,055 INFO L93 Difference]: Finished difference Result 643 states and 718 transitions. [2021-11-05 12:31:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-05 12:31:17,056 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:31:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:31:17,057 INFO L225 Difference]: With dead ends: 643 [2021-11-05 12:31:17,058 INFO L226 Difference]: Without dead ends: 561 [2021-11-05 12:31:17,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 4113.11ms TimeCoverageRelationStatistics Valid=561, Invalid=2091, Unknown=0, NotChecked=0, Total=2652 [2021-11-05 12:31:17,059 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1349 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 73 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19295.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.52ms SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20419.74ms IncrementalHoareTripleChecker+Time [2021-11-05 12:31:17,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1349 Valid, 2928 Invalid, 1251 Unknown, 0 Unchecked, 13.52ms Time], IncrementalHoareTripleChecker [73 Valid, 1170 Invalid, 8 Unknown, 0 Unchecked, 20419.74ms Time] [2021-11-05 12:31:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-05 12:31:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 284. [2021-11-05 12:31:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 273 states have (on average 1.1721611721611722) internal successors, (320), 283 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-05 12:31:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 320 transitions. [2021-11-05 12:31:17,068 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 320 transitions. Word has length 75 [2021-11-05 12:31:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:31:17,068 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 320 transitions. [2021-11-05 12:31:17,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 320 transitions. [2021-11-05 12:31:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:31:17,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:31:17,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:31:17,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 12:31:17,070 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:31:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:31:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2045087787, now seen corresponding path program 1 times [2021-11-05 12:31:17,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:31:17,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387856445] [2021-11-05 12:31:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:31:17,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:31:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:31:17,752 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-05 12:31:17,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:31:17,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387856445] [2021-11-05 12:31:17,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387856445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:31:17,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:31:17,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:31:17,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149250342] [2021-11-05 12:31:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:31:17,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:31:17,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:31:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:31:17,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:31:17,754 INFO L87 Difference]: Start difference. First operand 284 states and 320 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:19,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:21,910 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:24,039 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:26,166 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:31:28,710 INFO L93 Difference]: Finished difference Result 516 states and 578 transitions. [2021-11-05 12:31:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-05 12:31:28,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:31:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:31:28,712 INFO L225 Difference]: With dead ends: 516 [2021-11-05 12:31:28,712 INFO L226 Difference]: Without dead ends: 436 [2021-11-05 12:31:28,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1195.14ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-11-05 12:31:28,713 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 842 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 47 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9428.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.12ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9976.86ms IncrementalHoareTripleChecker+Time [2021-11-05 12:31:28,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [842 Valid, 1029 Invalid, 576 Unknown, 0 Unchecked, 6.12ms Time], IncrementalHoareTripleChecker [47 Valid, 525 Invalid, 4 Unknown, 0 Unchecked, 9976.86ms Time] [2021-11-05 12:31:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-11-05 12:31:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 292. [2021-11-05 12:31:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 281 states have (on average 1.1779359430604983) internal successors, (331), 291 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 331 transitions. [2021-11-05 12:31:28,721 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 331 transitions. Word has length 75 [2021-11-05 12:31:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:31:28,721 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 331 transitions. [2021-11-05 12:31:28,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 331 transitions. [2021-11-05 12:31:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:31:28,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:31:28,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:31:28,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 12:31:28,722 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:31:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:31:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash 353912167, now seen corresponding path program 1 times [2021-11-05 12:31:28,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:31:28,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507585104] [2021-11-05 12:31:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:31:28,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:31:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:31:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:31:29,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:31:29,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507585104] [2021-11-05 12:31:29,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507585104] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:31:29,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:31:29,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:31:29,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227861382] [2021-11-05 12:31:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:31:29,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:31:29,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:31:29,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:31:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:31:29,365 INFO L87 Difference]: Start difference. First operand 292 states and 331 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:31,407 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:31:33,096 INFO L93 Difference]: Finished difference Result 1052 states and 1198 transitions. [2021-11-05 12:31:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 12:31:33,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:31:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:31:33,098 INFO L225 Difference]: With dead ends: 1052 [2021-11-05 12:31:33,099 INFO L226 Difference]: Without dead ends: 857 [2021-11-05 12:31:33,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 306.83ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:31:33,100 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 545 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3273.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.57ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3465.74ms IncrementalHoareTripleChecker+Time [2021-11-05 12:31:33,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 1666 Invalid, 503 Unknown, 0 Unchecked, 5.57ms Time], IncrementalHoareTripleChecker [21 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 3465.74ms Time] [2021-11-05 12:31:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2021-11-05 12:31:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 300. [2021-11-05 12:31:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 289 states have (on average 1.1730103806228374) internal successors, (339), 299 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 339 transitions. [2021-11-05 12:31:33,109 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 339 transitions. Word has length 75 [2021-11-05 12:31:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:31:33,109 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 339 transitions. [2021-11-05 12:31:33,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 339 transitions. [2021-11-05 12:31:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:31:33,110 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:31:33,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:31:33,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 12:31:33,110 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:31:33,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:31:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1229931173, now seen corresponding path program 1 times [2021-11-05 12:31:33,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:31:33,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850693532] [2021-11-05 12:31:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:31:33,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:31:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:31:33,918 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-05 12:31:33,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:31:33,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850693532] [2021-11-05 12:31:33,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850693532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:31:33,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:31:33,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 12:31:33,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081511632] [2021-11-05 12:31:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:31:33,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 12:31:33,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:31:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 12:31:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:31:33,921 INFO L87 Difference]: Start difference. First operand 300 states and 339 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:35,963 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:38,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:40,177 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:31:41,892 INFO L93 Difference]: Finished difference Result 482 states and 541 transitions. [2021-11-05 12:31:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 12:31:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:31:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:31:41,894 INFO L225 Difference]: With dead ends: 482 [2021-11-05 12:31:41,894 INFO L226 Difference]: Without dead ends: 409 [2021-11-05 12:31:41,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 616.49ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-11-05 12:31:41,895 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 707 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 36 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7142.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.05ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7558.47ms IncrementalHoareTripleChecker+Time [2021-11-05 12:31:41,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [707 Valid, 965 Invalid, 448 Unknown, 0 Unchecked, 5.05ms Time], IncrementalHoareTripleChecker [36 Valid, 409 Invalid, 3 Unknown, 0 Unchecked, 7558.47ms Time] [2021-11-05 12:31:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-05 12:31:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 307. [2021-11-05 12:31:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 296 states have (on average 1.1722972972972974) internal successors, (347), 306 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-05 12:31:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 347 transitions. [2021-11-05 12:31:41,904 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 347 transitions. Word has length 75 [2021-11-05 12:31:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:31:41,904 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 347 transitions. [2021-11-05 12:31:41,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 347 transitions. [2021-11-05 12:31:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:31:41,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:31:41,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:31:41,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 12:31:41,906 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:31:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:31:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1909989543, now seen corresponding path program 1 times [2021-11-05 12:31:41,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:31:41,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650569922] [2021-11-05 12:31:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:31:41,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:31:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:31:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:31:42,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:31:42,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650569922] [2021-11-05 12:31:42,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650569922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:31:42,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:31:42,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:31:42,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127184574] [2021-11-05 12:31:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:31:42,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:31:42,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:31:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:31:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:31:42,428 INFO L87 Difference]: Start difference. First operand 307 states and 347 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:44,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:31:45,170 INFO L93 Difference]: Finished difference Result 470 states and 522 transitions. [2021-11-05 12:31:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:31:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:31:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:31:45,172 INFO L225 Difference]: With dead ends: 470 [2021-11-05 12:31:45,172 INFO L226 Difference]: Without dead ends: 385 [2021-11-05 12:31:45,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 72.04ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:31:45,173 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 313 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2506.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.99ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2699.90ms IncrementalHoareTripleChecker+Time [2021-11-05 12:31:45,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 611 Invalid, 210 Unknown, 0 Unchecked, 1.99ms Time], IncrementalHoareTripleChecker [29 Valid, 180 Invalid, 1 Unknown, 0 Unchecked, 2699.90ms Time] [2021-11-05 12:31:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-05 12:31:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 307. [2021-11-05 12:31:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 296 states have (on average 1.1587837837837838) internal successors, (343), 306 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 343 transitions. [2021-11-05 12:31:45,181 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 343 transitions. Word has length 75 [2021-11-05 12:31:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:31:45,181 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 343 transitions. [2021-11-05 12:31:45,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 343 transitions. [2021-11-05 12:31:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-05 12:31:45,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:31:45,182 INFO L514 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-05 12:31:45,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 12:31:45,182 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:31:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:31:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1964944096, now seen corresponding path program 1 times [2021-11-05 12:31:45,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:31:45,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442463174] [2021-11-05 12:31:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:31:45,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:31:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:31:45,576 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-05 12:31:45,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:31:45,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442463174] [2021-11-05 12:31:45,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442463174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:31:45,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:31:45,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:31:45,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315239548] [2021-11-05 12:31:45,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:31:45,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:31:45,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:31:45,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:31:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:31:45,578 INFO L87 Difference]: Start difference. First operand 307 states and 343 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05 12:31:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:31:46,653 INFO L93 Difference]: Finished difference Result 451 states and 499 transitions. [2021-11-05 12:31:46,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-05 12:31:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05 12:31:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:31:46,655 INFO L225 Difference]: With dead ends: 451 [2021-11-05 12:31:46,655 INFO L226 Difference]: Without dead ends: 434 [2021-11-05 12:31:46,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 436.30ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-05 12:31:46,656 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 242 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 717.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 760.90ms IncrementalHoareTripleChecker+Time [2021-11-05 12:31:46,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 1106 Invalid, 419 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [89 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 760.90ms Time] [2021-11-05 12:31:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-05 12:31:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 311. [2021-11-05 12:31:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 300 states have (on average 1.1533333333333333) internal successors, (346), 310 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:31:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 346 transitions. [2021-11-05 12:31:46,664 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 346 transitions. Word has length 77 [2021-11-05 12:31:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:31:46,665 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 346 transitions. [2021-11-05 12:31:46,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05 12:31:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 346 transitions. [2021-11-05 12:31:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-05 12:31:46,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:31:46,666 INFO L514 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-05 12:31:46,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-05 12:31:46,666 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:31:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:31:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1155597470, now seen corresponding path program 1 times [2021-11-05 12:31:46,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:31:46,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071664596] [2021-11-05 12:31:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:31:46,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:31:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:31:47,706 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-05 12:31:47,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:31:47,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071664596] [2021-11-05 12:31:47,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071664596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:31:47,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:31:47,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-05 12:31:47,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755102353] [2021-11-05 12:31:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:31:47,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-05 12:31:47,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:31:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-05 12:31:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-05 12:31:47,707 INFO L87 Difference]: Start difference. First operand 311 states and 346 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-05 12:31:49,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:51,895 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:54,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:56,111 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:31:58,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:00,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:02,507 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:07,337 INFO L93 Difference]: Finished difference Result 603 states and 663 transitions. [2021-11-05 12:32:07,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-05 12:32:07,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-05 12:32:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:07,339 INFO L225 Difference]: With dead ends: 603 [2021-11-05 12:32:07,339 INFO L226 Difference]: Without dead ends: 455 [2021-11-05 12:32:07,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2246.11ms TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2021-11-05 12:32:07,341 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 915 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 50 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16766.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.20ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17754.97ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:07,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 2189 Invalid, 961 Unknown, 0 Unchecked, 12.20ms Time], IncrementalHoareTripleChecker [50 Valid, 904 Invalid, 7 Unknown, 0 Unchecked, 17754.97ms Time] [2021-11-05 12:32:07,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-11-05 12:32:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 296. [2021-11-05 12:32:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 285 states have (on average 1.1543859649122807) internal successors, (329), 295 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 329 transitions. [2021-11-05 12:32:07,350 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 329 transitions. Word has length 77 [2021-11-05 12:32:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:07,351 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 329 transitions. [2021-11-05 12:32:07,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-05 12:32:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 329 transitions. [2021-11-05 12:32:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 12:32:07,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:07,352 INFO L514 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] [2021-11-05 12:32:07,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 12:32:07,352 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1086849495, now seen corresponding path program 1 times [2021-11-05 12:32:07,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:07,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826050001] [2021-11-05 12:32:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:07,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:08,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-05 12:32:08,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:08,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826050001] [2021-11-05 12:32:08,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826050001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:08,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:08,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 12:32:08,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064727426] [2021-11-05 12:32:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:08,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 12:32:08,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 12:32:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:32:08,252 INFO L87 Difference]: Start difference. First operand 296 states and 329 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:10,296 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:12,415 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:14,538 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:18,145 INFO L93 Difference]: Finished difference Result 890 states and 986 transitions. [2021-11-05 12:32:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-05 12:32:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-05 12:32:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:18,148 INFO L225 Difference]: With dead ends: 890 [2021-11-05 12:32:18,148 INFO L226 Difference]: Without dead ends: 735 [2021-11-05 12:32:18,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1143.39ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-05 12:32:18,149 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 1026 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8509.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.70ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9025.39ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:18,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 2112 Invalid, 1021 Unknown, 0 Unchecked, 10.70ms Time], IncrementalHoareTripleChecker [51 Valid, 967 Invalid, 3 Unknown, 0 Unchecked, 9025.39ms Time] [2021-11-05 12:32:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-11-05 12:32:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 296. [2021-11-05 12:32:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 285 states have (on average 1.1543859649122807) internal successors, (329), 295 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 329 transitions. [2021-11-05 12:32:18,164 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 329 transitions. Word has length 78 [2021-11-05 12:32:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:18,164 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 329 transitions. [2021-11-05 12:32:18,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 329 transitions. [2021-11-05 12:32:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 12:32:18,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:18,165 INFO L514 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] [2021-11-05 12:32:18,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 12:32:18,165 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2116208793, now seen corresponding path program 1 times [2021-11-05 12:32:18,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:18,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449069038] [2021-11-05 12:32:18,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:18,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:21,050 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-05 12:32:21,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:21,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449069038] [2021-11-05 12:32:21,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449069038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:21,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:21,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-05 12:32:21,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359057726] [2021-11-05 12:32:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:21,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 12:32:21,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 12:32:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:32:21,058 INFO L87 Difference]: Start difference. First operand 296 states and 329 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:23,107 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:25,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:27,291 INFO L93 Difference]: Finished difference Result 588 states and 648 transitions. [2021-11-05 12:32:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-05 12:32:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-05 12:32:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:27,293 INFO L225 Difference]: With dead ends: 588 [2021-11-05 12:32:27,293 INFO L226 Difference]: Without dead ends: 433 [2021-11-05 12:32:27,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1174.83ms TimeCoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2021-11-05 12:32:27,294 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 1397 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5006.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.13ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5320.03ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:27,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 1210 Invalid, 417 Unknown, 0 Unchecked, 6.13ms Time], IncrementalHoareTripleChecker [31 Valid, 384 Invalid, 2 Unknown, 0 Unchecked, 5320.03ms Time] [2021-11-05 12:32:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-05 12:32:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 272. [2021-11-05 12:32:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 261 states have (on average 1.157088122605364) internal successors, (302), 271 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 302 transitions. [2021-11-05 12:32:27,302 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 302 transitions. Word has length 78 [2021-11-05 12:32:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:27,302 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 302 transitions. [2021-11-05 12:32:27,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 302 transitions. [2021-11-05 12:32:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-05 12:32:27,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:27,303 INFO L514 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-05 12:32:27,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-05 12:32:27,304 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1807055272, now seen corresponding path program 1 times [2021-11-05 12:32:27,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:27,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909151456] [2021-11-05 12:32:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:27,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:27,929 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-05 12:32:27,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:27,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909151456] [2021-11-05 12:32:27,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909151456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:27,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:27,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:32:27,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087926152] [2021-11-05 12:32:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:27,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:32:27,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:32:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:32:27,931 INFO L87 Difference]: Start difference. First operand 272 states and 302 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-05 12:32:29,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:30,722 INFO L93 Difference]: Finished difference Result 553 states and 616 transitions. [2021-11-05 12:32:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 12:32:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-05 12:32:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:30,724 INFO L225 Difference]: With dead ends: 553 [2021-11-05 12:32:30,724 INFO L226 Difference]: Without dead ends: 410 [2021-11-05 12:32:30,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 227.67ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:32:30,725 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 430 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2486.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2655.08ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:30,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 543 Invalid, 194 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [18 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 2655.08ms Time] [2021-11-05 12:32:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-05 12:32:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 292. [2021-11-05 12:32:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 281 states have (on average 1.1459074733096086) internal successors, (322), 291 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-05 12:32:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 322 transitions. [2021-11-05 12:32:30,743 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 322 transitions. Word has length 81 [2021-11-05 12:32:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:30,743 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 322 transitions. [2021-11-05 12:32:30,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-05 12:32:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 322 transitions. [2021-11-05 12:32:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-05 12:32:30,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:30,744 INFO L514 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-05 12:32:30,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-05 12:32:30,744 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 899564122, now seen corresponding path program 1 times [2021-11-05 12:32:30,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:30,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123923660] [2021-11-05 12:32:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:30,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:32:31,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:31,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123923660] [2021-11-05 12:32:31,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123923660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:31,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:31,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 12:32:31,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628652886] [2021-11-05 12:32:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:31,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 12:32:31,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:31,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 12:32:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:32:31,446 INFO L87 Difference]: Start difference. First operand 292 states and 322 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-05 12:32:33,487 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:35,640 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:37,556 INFO L93 Difference]: Finished difference Result 503 states and 554 transitions. [2021-11-05 12:32:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-05 12:32:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-05 12:32:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:37,558 INFO L225 Difference]: With dead ends: 503 [2021-11-05 12:32:37,558 INFO L226 Difference]: Without dead ends: 423 [2021-11-05 12:32:37,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 772.64ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-05 12:32:37,559 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 992 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5193.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.86ms SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5531.05ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:37,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [992 Valid, 847 Invalid, 444 Unknown, 0 Unchecked, 5.86ms Time], IncrementalHoareTripleChecker [54 Valid, 388 Invalid, 2 Unknown, 0 Unchecked, 5531.05ms Time] [2021-11-05 12:32:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-11-05 12:32:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 300. [2021-11-05 12:32:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 289 states have (on average 1.1522491349480968) internal successors, (333), 299 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 333 transitions. [2021-11-05 12:32:37,569 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 333 transitions. Word has length 81 [2021-11-05 12:32:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:37,569 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 333 transitions. [2021-11-05 12:32:37,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-05 12:32:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 333 transitions. [2021-11-05 12:32:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-05 12:32:37,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:37,570 INFO L514 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-05 12:32:37,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-05 12:32:37,571 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash -791611498, now seen corresponding path program 1 times [2021-11-05 12:32:37,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:37,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114864335] [2021-11-05 12:32:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:37,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:38,249 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-05 12:32:38,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:38,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114864335] [2021-11-05 12:32:38,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114864335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:38,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:38,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:32:38,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497708888] [2021-11-05 12:32:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:38,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:32:38,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:38,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:32:38,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:32:38,251 INFO L87 Difference]: Start difference. First operand 300 states and 333 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-05 12:32:40,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:42,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:44,232 INFO L93 Difference]: Finished difference Result 486 states and 535 transitions. [2021-11-05 12:32:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 12:32:44,232 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-05 12:32:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:44,233 INFO L225 Difference]: With dead ends: 486 [2021-11-05 12:32:44,233 INFO L226 Difference]: Without dead ends: 413 [2021-11-05 12:32:44,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 559.96ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-05 12:32:44,234 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 437 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5194.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.76ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5577.31ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:44,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 1119 Invalid, 468 Unknown, 0 Unchecked, 4.76ms Time], IncrementalHoareTripleChecker [28 Valid, 438 Invalid, 2 Unknown, 0 Unchecked, 5577.31ms Time] [2021-11-05 12:32:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-05 12:32:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 307. [2021-11-05 12:32:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 296 states have (on average 1.1486486486486487) internal successors, (340), 306 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 340 transitions. [2021-11-05 12:32:44,243 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 340 transitions. Word has length 81 [2021-11-05 12:32:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:44,243 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 340 transitions. [2021-11-05 12:32:44,243 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-05 12:32:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 340 transitions. [2021-11-05 12:32:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-05 12:32:44,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:44,244 INFO L514 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-05 12:32:44,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-05 12:32:44,245 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash 116172762, now seen corresponding path program 1 times [2021-11-05 12:32:44,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:44,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86700227] [2021-11-05 12:32:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:44,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:45,094 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-05 12:32:45,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:45,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86700227] [2021-11-05 12:32:45,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86700227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:45,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:45,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-05 12:32:45,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770645136] [2021-11-05 12:32:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:45,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 12:32:45,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:45,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 12:32:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:32:45,096 INFO L87 Difference]: Start difference. First operand 307 states and 340 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:47,139 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:49,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:51,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:53,551 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:55,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:32:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:32:58,025 INFO L93 Difference]: Finished difference Result 618 states and 678 transitions. [2021-11-05 12:32:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-05 12:32:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-05 12:32:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:32:58,027 INFO L225 Difference]: With dead ends: 618 [2021-11-05 12:32:58,027 INFO L226 Difference]: Without dead ends: 465 [2021-11-05 12:32:58,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 789.26ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-11-05 12:32:58,028 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 460 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 36 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11635.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.77ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12407.03ms IncrementalHoareTripleChecker+Time [2021-11-05 12:32:58,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1483 Invalid, 738 Unknown, 0 Unchecked, 5.77ms Time], IncrementalHoareTripleChecker [36 Valid, 697 Invalid, 5 Unknown, 0 Unchecked, 12407.03ms Time] [2021-11-05 12:32:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-05 12:32:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 322. [2021-11-05 12:32:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 311 states have (on average 1.1414790996784565) internal successors, (355), 321 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 355 transitions. [2021-11-05 12:32:58,037 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 355 transitions. Word has length 81 [2021-11-05 12:32:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:32:58,037 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 355 transitions. [2021-11-05 12:32:58,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:32:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 355 transitions. [2021-11-05 12:32:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-05 12:32:58,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:32:58,038 INFO L514 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-05 12:32:58,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-05 12:32:58,038 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:32:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:32:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -221691569, now seen corresponding path program 1 times [2021-11-05 12:32:58,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:32:58,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230670866] [2021-11-05 12:32:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:32:58,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:32:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:32:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:32:58,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:32:58,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230670866] [2021-11-05 12:32:58,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230670866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:32:58,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:32:58,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:32:58,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861733498] [2021-11-05 12:32:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:32:58,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:32:58,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:32:58,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:32:58,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:32:58,619 INFO L87 Difference]: Start difference. First operand 322 states and 355 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-05 12:33:00,661 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:02,784 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:04,862 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:33:06,094 INFO L93 Difference]: Finished difference Result 500 states and 548 transitions. [2021-11-05 12:33:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 12:33:06,095 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-05 12:33:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:33:06,096 INFO L225 Difference]: With dead ends: 500 [2021-11-05 12:33:06,096 INFO L226 Difference]: Without dead ends: 426 [2021-11-05 12:33:06,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 262.95ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:33:06,097 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 419 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6928.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7290.84ms IncrementalHoareTripleChecker+Time [2021-11-05 12:33:06,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 837 Invalid, 343 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [22 Valid, 318 Invalid, 3 Unknown, 0 Unchecked, 7290.84ms Time] [2021-11-05 12:33:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-11-05 12:33:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 323. [2021-11-05 12:33:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 312 states have (on average 1.141025641025641) internal successors, (356), 322 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 356 transitions. [2021-11-05 12:33:06,108 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 356 transitions. Word has length 83 [2021-11-05 12:33:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:33:06,108 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 356 transitions. [2021-11-05 12:33:06,108 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-05 12:33:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 356 transitions. [2021-11-05 12:33:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 12:33:06,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:33:06,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:33:06,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-05 12:33:06,110 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:33:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:33:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1145198086, now seen corresponding path program 1 times [2021-11-05 12:33:06,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:33:06,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538579412] [2021-11-05 12:33:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:33:06,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:33:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:33:07,141 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-05 12:33:07,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:33:07,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538579412] [2021-11-05 12:33:07,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538579412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:33:07,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:33:07,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 12:33:07,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197242992] [2021-11-05 12:33:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:33:07,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 12:33:07,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:33:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 12:33:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:33:07,143 INFO L87 Difference]: Start difference. First operand 323 states and 356 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:09,189 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:11,349 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:13,453 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:33:15,912 INFO L93 Difference]: Finished difference Result 774 states and 851 transitions. [2021-11-05 12:33:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-05 12:33:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-05 12:33:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:33:15,914 INFO L225 Difference]: With dead ends: 774 [2021-11-05 12:33:15,914 INFO L226 Difference]: Without dead ends: 566 [2021-11-05 12:33:15,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1386.30ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-11-05 12:33:15,915 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 930 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7257.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.23ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7736.53ms IncrementalHoareTripleChecker+Time [2021-11-05 12:33:15,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [930 Valid, 1144 Invalid, 528 Unknown, 0 Unchecked, 6.23ms Time], IncrementalHoareTripleChecker [50 Valid, 475 Invalid, 3 Unknown, 0 Unchecked, 7736.53ms Time] [2021-11-05 12:33:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-11-05 12:33:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 351. [2021-11-05 12:33:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 340 states have (on average 1.1294117647058823) internal successors, (384), 350 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 384 transitions. [2021-11-05 12:33:15,925 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 384 transitions. Word has length 84 [2021-11-05 12:33:15,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:33:15,925 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 384 transitions. [2021-11-05 12:33:15,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 384 transitions. [2021-11-05 12:33:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 12:33:15,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:33:15,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:33:15,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-05 12:33:15,926 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:33:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:33:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash -575155446, now seen corresponding path program 1 times [2021-11-05 12:33:15,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:33:15,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498194537] [2021-11-05 12:33:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:33:15,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:33:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:33:20,440 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-05 12:33:20,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:33:20,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498194537] [2021-11-05 12:33:20,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498194537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:33:20,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:33:20,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 12:33:20,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740170005] [2021-11-05 12:33:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:33:20,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 12:33:20,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:33:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 12:33:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:33:20,442 INFO L87 Difference]: Start difference. First operand 351 states and 384 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:22,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:24,595 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:26,700 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:28,803 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:30,981 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:33,086 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:35,210 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:33:37,947 INFO L93 Difference]: Finished difference Result 646 states and 705 transitions. [2021-11-05 12:33:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-05 12:33:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-05 12:33:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:33:37,949 INFO L225 Difference]: With dead ends: 646 [2021-11-05 12:33:37,949 INFO L226 Difference]: Without dead ends: 535 [2021-11-05 12:33:37,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1402.42ms TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-11-05 12:33:37,950 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 768 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 40 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15634.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.22ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16519.71ms IncrementalHoareTripleChecker+Time [2021-11-05 12:33:37,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 1479 Invalid, 632 Unknown, 0 Unchecked, 7.22ms Time], IncrementalHoareTripleChecker [40 Valid, 585 Invalid, 7 Unknown, 0 Unchecked, 16519.71ms Time] [2021-11-05 12:33:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-11-05 12:33:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 310. [2021-11-05 12:33:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.120401337792642) internal successors, (335), 309 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 335 transitions. [2021-11-05 12:33:37,962 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 335 transitions. Word has length 84 [2021-11-05 12:33:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:33:37,962 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 335 transitions. [2021-11-05 12:33:37,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 335 transitions. [2021-11-05 12:33:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 12:33:37,963 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:33:37,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:33:37,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-05 12:33:37,963 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:33:37,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:33:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -963374140, now seen corresponding path program 1 times [2021-11-05 12:33:37,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:33:37,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873963996] [2021-11-05 12:33:37,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:33:37,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:33:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:33:41,025 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-05 12:33:41,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:33:41,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873963996] [2021-11-05 12:33:41,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873963996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:33:41,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:33:41,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 12:33:41,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982535026] [2021-11-05 12:33:41,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:33:41,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 12:33:41,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:33:41,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 12:33:41,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:33:41,026 INFO L87 Difference]: Start difference. First operand 310 states and 335 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:33:47,193 INFO L93 Difference]: Finished difference Result 815 states and 885 transitions. [2021-11-05 12:33:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-05 12:33:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-05 12:33:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:33:47,195 INFO L225 Difference]: With dead ends: 815 [2021-11-05 12:33:47,195 INFO L226 Difference]: Without dead ends: 614 [2021-11-05 12:33:47,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3857.07ms TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2021-11-05 12:33:47,196 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 774 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2705.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.67ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2891.23ms IncrementalHoareTripleChecker+Time [2021-11-05 12:33:47,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1704 Invalid, 1043 Unknown, 0 Unchecked, 10.67ms Time], IncrementalHoareTripleChecker [47 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 2891.23ms Time] [2021-11-05 12:33:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-05 12:33:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 307. [2021-11-05 12:33:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 296 states have (on average 1.1182432432432432) internal successors, (331), 306 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 331 transitions. [2021-11-05 12:33:47,207 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 331 transitions. Word has length 84 [2021-11-05 12:33:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:33:47,208 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 331 transitions. [2021-11-05 12:33:47,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:33:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 331 transitions. [2021-11-05 12:33:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 12:33:47,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:33:47,209 INFO L514 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-05 12:33:47,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-05 12:33:47,210 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:33:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:33:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -279947773, now seen corresponding path program 1 times [2021-11-05 12:33:47,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:33:47,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494123828] [2021-11-05 12:33:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:33:47,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:33:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:33:55,489 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-05 12:33:55,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:33:55,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494123828] [2021-11-05 12:33:55,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494123828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:33:55,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:33:55,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-11-05 12:33:55,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857874308] [2021-11-05 12:33:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:33:55,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-05 12:33:55,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:33:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-05 12:33:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-11-05 12:33:55,491 INFO L87 Difference]: Start difference. First operand 307 states and 331 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 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-05 12:33:57,532 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:33:59,708 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:01,831 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:03,948 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:06,079 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:08,231 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:10,334 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:34:16,222 INFO L93 Difference]: Finished difference Result 462 states and 499 transitions. [2021-11-05 12:34:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-05 12:34:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 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-05 12:34:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:34:16,223 INFO L225 Difference]: With dead ends: 462 [2021-11-05 12:34:16,223 INFO L226 Difference]: Without dead ends: 389 [2021-11-05 12:34:16,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 4814.79ms TimeCoverageRelationStatistics Valid=500, Invalid=1662, Unknown=0, NotChecked=0, Total=2162 [2021-11-05 12:34:16,224 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 1541 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 125 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16463.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.81ms SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17542.28ms IncrementalHoareTripleChecker+Time [2021-11-05 12:34:16,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 1496 Invalid, 894 Unknown, 0 Unchecked, 9.81ms Time], IncrementalHoareTripleChecker [125 Valid, 762 Invalid, 7 Unknown, 0 Unchecked, 17542.28ms Time] [2021-11-05 12:34:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-05 12:34:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 307. [2021-11-05 12:34:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 296 states have (on average 1.114864864864865) internal successors, (330), 306 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-05 12:34:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 330 transitions. [2021-11-05 12:34:16,236 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 330 transitions. Word has length 87 [2021-11-05 12:34:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:34:16,236 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 330 transitions. [2021-11-05 12:34:16,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 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-05 12:34:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 330 transitions. [2021-11-05 12:34:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-05 12:34:16,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:34:16,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:34:16,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-05 12:34:16,238 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:34:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:34:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -358609724, now seen corresponding path program 1 times [2021-11-05 12:34:16,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:34:16,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770478606] [2021-11-05 12:34:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:34:16,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:34:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:34:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:34:16,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:34:16,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770478606] [2021-11-05 12:34:16,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770478606] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:34:16,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:34:16,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:34:16,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585013233] [2021-11-05 12:34:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:34:16,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:34:16,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:34:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:34:16,468 INFO L87 Difference]: Start difference. First operand 307 states and 330 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:34:16,565 INFO L93 Difference]: Finished difference Result 398 states and 429 transitions. [2021-11-05 12:34:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:34:16,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-05 12:34:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:34:16,567 INFO L225 Difference]: With dead ends: 398 [2021-11-05 12:34:16,567 INFO L226 Difference]: Without dead ends: 360 [2021-11-05 12:34:16,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.93ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:34:16,567 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 101 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.49ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.80ms IncrementalHoareTripleChecker+Time [2021-11-05 12:34:16,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 805 Invalid, 16 Unknown, 0 Unchecked, 0.49ms Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 38.80ms Time] [2021-11-05 12:34:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-05 12:34:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 310. [2021-11-05 12:34:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.1137123745819397) internal successors, (333), 309 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 333 transitions. [2021-11-05 12:34:16,579 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 333 transitions. Word has length 88 [2021-11-05 12:34:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:34:16,580 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 333 transitions. [2021-11-05 12:34:16,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 333 transitions. [2021-11-05 12:34:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-05 12:34:16,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:34:16,581 INFO L514 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-05 12:34:16,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-05 12:34:16,581 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:34:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:34:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1768895642, now seen corresponding path program 1 times [2021-11-05 12:34:16,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:34:16,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226146967] [2021-11-05 12:34:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:34:16,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:34:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:34:16,938 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-05 12:34:16,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:34:16,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226146967] [2021-11-05 12:34:16,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226146967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:34:16,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:34:16,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:34:16,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549673837] [2021-11-05 12:34:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:34:16,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:34:16,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:34:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:34:16,940 INFO L87 Difference]: Start difference. First operand 310 states and 333 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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-05 12:34:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:34:17,256 INFO L93 Difference]: Finished difference Result 336 states and 361 transitions. [2021-11-05 12:34:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:34:17,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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-05 12:34:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:34:17,257 INFO L225 Difference]: With dead ends: 336 [2021-11-05 12:34:17,257 INFO L226 Difference]: Without dead ends: 334 [2021-11-05 12:34:17,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 206.94ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:34:17,258 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 379 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.31ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.06ms IncrementalHoareTripleChecker+Time [2021-11-05 12:34:17,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 546 Invalid, 69 Unknown, 0 Unchecked, 1.31ms Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 181.06ms Time] [2021-11-05 12:34:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-05 12:34:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 308. [2021-11-05 12:34:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 298 states have (on average 1.110738255033557) internal successors, (331), 307 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 331 transitions. [2021-11-05 12:34:17,270 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 331 transitions. Word has length 89 [2021-11-05 12:34:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:34:17,270 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 331 transitions. [2021-11-05 12:34:17,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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-05 12:34:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 331 transitions. [2021-11-05 12:34:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-05 12:34:17,271 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:34:17,271 INFO L514 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-05 12:34:17,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-05 12:34:17,271 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:34:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:34:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1860876412, now seen corresponding path program 1 times [2021-11-05 12:34:17,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:34:17,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994144538] [2021-11-05 12:34:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:34:17,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:34:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:34:21,275 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-05 12:34:21,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:34:21,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994144538] [2021-11-05 12:34:21,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994144538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:34:21,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:34:21,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-05 12:34:21,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998082300] [2021-11-05 12:34:21,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:34:21,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-05 12:34:21,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-05 12:34:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-11-05 12:34:21,277 INFO L87 Difference]: Start difference. First operand 308 states and 331 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 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-05 12:34:23,317 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:25,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:27,619 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:29,723 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:31,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:33,974 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:36,104 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:38,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:34:46,617 INFO L93 Difference]: Finished difference Result 544 states and 593 transitions. [2021-11-05 12:34:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-05 12:34:46,617 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 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-05 12:34:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:34:46,618 INFO L225 Difference]: With dead ends: 544 [2021-11-05 12:34:46,618 INFO L226 Difference]: Without dead ends: 540 [2021-11-05 12:34:46,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 6669.04ms TimeCoverageRelationStatistics Valid=920, Invalid=4050, Unknown=0, NotChecked=0, Total=4970 [2021-11-05 12:34:46,620 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 1398 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 251 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18317.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.57ms SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19436.09ms IncrementalHoareTripleChecker+Time [2021-11-05 12:34:46,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 1473 Invalid, 1127 Unknown, 0 Unchecked, 11.57ms Time], IncrementalHoareTripleChecker [251 Valid, 868 Invalid, 8 Unknown, 0 Unchecked, 19436.09ms Time] [2021-11-05 12:34:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-11-05 12:34:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 314. [2021-11-05 12:34:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 305 states have (on average 1.118032786885246) internal successors, (341), 313 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 341 transitions. [2021-11-05 12:34:46,634 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 341 transitions. Word has length 89 [2021-11-05 12:34:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:34:46,634 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 341 transitions. [2021-11-05 12:34:46,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 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-05 12:34:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 341 transitions. [2021-11-05 12:34:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-05 12:34:46,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:34:46,635 INFO L514 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] [2021-11-05 12:34:46,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-05 12:34:46,636 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:34:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:34:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash -983153165, now seen corresponding path program 1 times [2021-11-05 12:34:46,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:34:46,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808889156] [2021-11-05 12:34:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:34:46,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:34:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:34:46,981 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-05 12:34:46,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:34:46,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808889156] [2021-11-05 12:34:46,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808889156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:34:46,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:34:46,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:34:46,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096674508] [2021-11-05 12:34:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:34:46,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:34:46,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:34:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:34:46,983 INFO L87 Difference]: Start difference. First operand 314 states and 341 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:34:47,091 INFO L93 Difference]: Finished difference Result 449 states and 489 transitions. [2021-11-05 12:34:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:34:47,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-11-05 12:34:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:34:47,092 INFO L225 Difference]: With dead ends: 449 [2021-11-05 12:34:47,092 INFO L226 Difference]: Without dead ends: 345 [2021-11-05 12:34:47,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.56ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:34:47,093 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 220 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.79ms IncrementalHoareTripleChecker+Time [2021-11-05 12:34:47,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 539 Invalid, 22 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 53.79ms Time] [2021-11-05 12:34:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-05 12:34:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 263. [2021-11-05 12:34:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 254 states have (on average 1.1181102362204725) internal successors, (284), 262 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 284 transitions. [2021-11-05 12:34:47,104 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 284 transitions. Word has length 91 [2021-11-05 12:34:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:34:47,104 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 284 transitions. [2021-11-05 12:34:47,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 284 transitions. [2021-11-05 12:34:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-05 12:34:47,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:34:47,104 INFO L514 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] [2021-11-05 12:34:47,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-05 12:34:47,105 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:34:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:34:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash -898198788, now seen corresponding path program 1 times [2021-11-05 12:34:47,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:34:47,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110061106] [2021-11-05 12:34:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:34:47,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:34:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:34:49,152 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-05 12:34:49,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:34:49,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110061106] [2021-11-05 12:34:49,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110061106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:34:49,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:34:49,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-05 12:34:49,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753700861] [2021-11-05 12:34:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:34:49,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-05 12:34:49,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:49,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-05 12:34:49,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-05 12:34:49,155 INFO L87 Difference]: Start difference. First operand 263 states and 284 transitions. Second operand has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:51,197 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:53,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:55,430 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:57,554 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:59,670 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:01,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:03,922 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:35:10,927 INFO L93 Difference]: Finished difference Result 673 states and 725 transitions. [2021-11-05 12:35:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-05 12:35:10,928 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-11-05 12:35:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:35:10,929 INFO L225 Difference]: With dead ends: 673 [2021-11-05 12:35:10,929 INFO L226 Difference]: Without dead ends: 626 [2021-11-05 12:35:10,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 5416.56ms TimeCoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2021-11-05 12:35:10,930 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 1964 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 85 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16358.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.34ms SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17334.85ms IncrementalHoareTripleChecker+Time [2021-11-05 12:35:10,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1964 Valid, 1989 Invalid, 904 Unknown, 0 Unchecked, 11.34ms Time], IncrementalHoareTripleChecker [85 Valid, 812 Invalid, 7 Unknown, 0 Unchecked, 17334.85ms Time] [2021-11-05 12:35:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-11-05 12:35:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 395. [2021-11-05 12:35:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 386 states have (on average 1.11139896373057) internal successors, (429), 394 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 429 transitions. [2021-11-05 12:35:10,953 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 429 transitions. Word has length 91 [2021-11-05 12:35:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:35:10,953 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 429 transitions. [2021-11-05 12:35:10,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 429 transitions. [2021-11-05 12:35:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-05 12:35:10,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:35:10,954 INFO L514 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-05 12:35:10,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-05 12:35:10,954 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:35:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:35:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash -203780239, now seen corresponding path program 1 times [2021-11-05 12:35:10,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:35:10,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634384051] [2021-11-05 12:35:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:35:10,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:35:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:35:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:35:12,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:35:12,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634384051] [2021-11-05 12:35:12,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634384051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:35:12,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:35:12,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-05 12:35:12,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318530157] [2021-11-05 12:35:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:35:12,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-05 12:35:12,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:35:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-05 12:35:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-05 12:35:12,377 INFO L87 Difference]: Start difference. First operand 395 states and 429 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 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-05 12:35:14,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:16,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:18,639 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:20,821 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:22,942 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:25,061 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:27,191 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:35:31,934 INFO L93 Difference]: Finished difference Result 524 states and 564 transitions. [2021-11-05 12:35:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-05 12:35:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 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-05 12:35:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:35:31,935 INFO L225 Difference]: With dead ends: 524 [2021-11-05 12:35:31,935 INFO L226 Difference]: Without dead ends: 348 [2021-11-05 12:35:31,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2604.30ms TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2021-11-05 12:35:31,936 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 810 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 84 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16511.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.20ms SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17543.88ms IncrementalHoareTripleChecker+Time [2021-11-05 12:35:31,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [810 Valid, 2107 Invalid, 1122 Unknown, 0 Unchecked, 10.20ms Time], IncrementalHoareTripleChecker [84 Valid, 1031 Invalid, 7 Unknown, 0 Unchecked, 17543.88ms Time] [2021-11-05 12:35:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-05 12:35:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 259. [2021-11-05 12:35:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 250 states have (on average 1.108) internal successors, (277), 258 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2021-11-05 12:35:31,948 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 93 [2021-11-05 12:35:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:35:31,948 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2021-11-05 12:35:31,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 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-05 12:35:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2021-11-05 12:35:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-05 12:35:31,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:35:31,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:35:31,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-05 12:35:31,949 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:35:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:35:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash -165511958, now seen corresponding path program 1 times [2021-11-05 12:35:31,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:35:31,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286896119] [2021-11-05 12:35:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:35:31,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:35:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:35:34,593 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-05 12:35:34,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:35:34,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286896119] [2021-11-05 12:35:34,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286896119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:35:34,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:35:34,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-05 12:35:34,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358406863] [2021-11-05 12:35:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:35:34,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-05 12:35:34,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:35:34,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-05 12:35:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-05 12:35:34,595 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:36,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:38,813 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:40,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:43,097 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:35:44,755 INFO L93 Difference]: Finished difference Result 350 states and 375 transitions. [2021-11-05 12:35:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 12:35:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-05 12:35:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:35:44,757 INFO L225 Difference]: With dead ends: 350 [2021-11-05 12:35:44,757 INFO L226 Difference]: Without dead ends: 348 [2021-11-05 12:35:44,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 984.96ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-11-05 12:35:44,758 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 697 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9009.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.05ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9640.92ms IncrementalHoareTripleChecker+Time [2021-11-05 12:35:44,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 884 Invalid, 392 Unknown, 0 Unchecked, 5.05ms Time], IncrementalHoareTripleChecker [25 Valid, 363 Invalid, 4 Unknown, 0 Unchecked, 9640.92ms Time] [2021-11-05 12:35:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-05 12:35:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 273. [2021-11-05 12:35:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 264 states have (on average 1.106060606060606) internal successors, (292), 272 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 292 transitions. [2021-11-05 12:35:44,772 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 292 transitions. Word has length 94 [2021-11-05 12:35:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:35:44,772 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 292 transitions. [2021-11-05 12:35:44,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 292 transitions. [2021-11-05 12:35:44,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-05 12:35:44,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:35:44,773 INFO L514 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] [2021-11-05 12:35:44,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-05 12:35:44,773 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-05 12:35:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:35:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash -466373153, now seen corresponding path program 1 times [2021-11-05 12:35:44,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:35:44,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508293932] [2021-11-05 12:35:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:35:44,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:35:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:35:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:35:52,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:35:52,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508293932] [2021-11-05 12:35:52,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508293932] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:35:52,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280960883] [2021-11-05 12:35:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:35:52,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:35:52,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:35:52,121 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-05 12:35:52,122 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-05 12:35:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:35:52,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 3047 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-05 12:35:52,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:35:52,866 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-05 12:35:53,082 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-05 12:35:53,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-05 12:35:53,240 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 15 treesize of output 1 [2021-11-05 12:35:53,257 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 16 treesize of output 12 [2021-11-05 12:35:54,238 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-05 12:35:54,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-11-05 12:35:54,280 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-05 12:35:54,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2021-11-05 12:35:55,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:35:55,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-11-05 12:35:55,992 INFO L354 Elim1Store]: treesize reduction 282, result has 22.3 percent of original size [2021-11-05 12:35:55,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 133 [2021-11-05 12:35:57,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:57,211 INFO L354 Elim1Store]: treesize reduction 63, result has 18.2 percent of original size [2021-11-05 12:35:57,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 68 [2021-11-05 12:35:58,951 INFO L354 Elim1Store]: treesize reduction 78, result has 15.2 percent of original size [2021-11-05 12:35:58,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 128 treesize of output 101 [2021-11-05 12:36:01,715 INFO L354 Elim1Store]: treesize reduction 356, result has 22.4 percent of original size [2021-11-05 12:36:01,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 97 treesize of output 156 [2021-11-05 12:36:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:36:07,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 12:36:10,412 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_memcpy_impl_~dst.offset Int) (aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 Int) (ULTIMATE.start_memcpy_impl_~src.offset Int) (ULTIMATE.start_aws_byte_buf_write_~len Int)) (or (<= 18446744073709551616 aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58) (<= aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 9223372036854775807) (not (= (mod (select (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_memcpy_impl_~dst.base (let ((.cse1 (mod aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 18446744073709551616))) (store (select |c_#memory_int| c_ULTIMATE.start_memcpy_impl_~dst.base) (+ (- 18446744073709551616) .cse1 ULTIMATE.start_memcpy_impl_~dst.offset) (select (select |c_#memory_int| c_ULTIMATE.start_memcpy_impl_~src.base) (+ (- 18446744073709551616) .cse1 ULTIMATE.start_memcpy_impl_~src.offset))))) c_ULTIMATE.start_aws_byte_buf_write_~buf.base))) (store .cse0 c_ULTIMATE.start_aws_byte_buf_write_~buf.offset (+ (select .cse0 c_ULTIMATE.start_aws_byte_buf_write_~buf.offset) ULTIMATE.start_aws_byte_buf_write_~len))) (+ c_ULTIMATE.start_aws_byte_buf_write_~buf.offset 16)) 18446744073709551616) 0)))) (forall ((ULTIMATE.start_memcpy_impl_~dst.offset Int) (aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 Int) (ULTIMATE.start_memcpy_impl_~src.offset Int) (ULTIMATE.start_aws_byte_buf_write_~len Int)) (or (< 9223372036854775807 aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58) (not (= (mod (select (let ((.cse2 (select (store |c_#memory_int| c_ULTIMATE.start_memcpy_impl_~dst.base (let ((.cse3 (mod aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 18446744073709551616))) (store (select |c_#memory_int| c_ULTIMATE.start_memcpy_impl_~dst.base) (+ .cse3 ULTIMATE.start_memcpy_impl_~dst.offset) (select (select |c_#memory_int| c_ULTIMATE.start_memcpy_impl_~src.base) (+ .cse3 ULTIMATE.start_memcpy_impl_~src.offset))))) c_ULTIMATE.start_aws_byte_buf_write_~buf.base))) (store .cse2 c_ULTIMATE.start_aws_byte_buf_write_~buf.offset (+ (select .cse2 c_ULTIMATE.start_aws_byte_buf_write_~buf.offset) ULTIMATE.start_aws_byte_buf_write_~len))) (+ c_ULTIMATE.start_aws_byte_buf_write_~buf.offset 16)) 18446744073709551616) 0)) (< aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 0)))) is different from false [2021-11-05 12:36:57,555 WARN L230 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 57 [2021-11-05 12:37:01,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| Int)) (or (and (forall ((ULTIMATE.start_memcpy_impl_~dst.offset Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2| Int) (aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 Int) (ULTIMATE.start_memcpy_impl_~src.offset Int) (v_DerPreprocessor_1 Int) (ULTIMATE.start_aws_byte_buf_write_~len Int)) (or (< 9223372036854775807 aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58) (< aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 0) (not (= (mod (select (let ((.cse0 (select (let ((.cse4 (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| |v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2|))) (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| .cse4)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| v_DerPreprocessor_1)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8)))) (store .cse1 .cse2 (let ((.cse3 (mod aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 18446744073709551616))) (store (select .cse1 .cse2) (+ .cse3 ULTIMATE.start_memcpy_impl_~dst.offset) (select .cse4 (+ .cse3 ULTIMATE.start_memcpy_impl_~src.offset))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|) ULTIMATE.start_aws_byte_buf_write_~len))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0)))) (forall ((v_prenex_15 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| Int) (v_prenex_14 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2| Int) (v_prenex_13 Int) (v_DerPreprocessor_1 Int)) (or (<= 18446744073709551616 v_prenex_13) (<= v_prenex_13 9223372036854775807) (not (= (mod (select (let ((.cse5 (select (let ((.cse9 (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| |v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2|))) (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| .cse9)) (.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| v_DerPreprocessor_1)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8)))) (store .cse6 .cse7 (let ((.cse8 (mod v_prenex_13 18446744073709551616))) (store (select .cse6 .cse7) (+ (- 18446744073709551616) v_prenex_12 .cse8) (select .cse9 (+ (- 18446744073709551616) v_prenex_14 .cse8))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse5 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ (select .cse5 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|) v_prenex_15))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0))))) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6|))) is different from false [2021-11-05 12:37:23,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 998 [2021-11-05 12:39:24,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| Int) (v_DerPreprocessor_2 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 Int)) (or (< 9223372036854775807 aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58) (let ((.cse1 (or (not (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8))) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (ULTIMATE.start_memcpy_impl_~dst.offset Int) (ULTIMATE.start_memcpy_impl_~src.offset Int) (ULTIMATE.start_aws_byte_buf_write_~len Int)) (not (= (mod (select (let ((.cse13 (select (let ((.cse17 (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)))) (let ((.cse16 (store (select .cse17 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| v_prenex_17))) (let ((.cse14 (store .cse17 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| .cse16))) (store .cse14 v_prenex_18 (let ((.cse15 (mod aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 18446744073709551616))) (store (select .cse14 v_prenex_18) (+ .cse15 ULTIMATE.start_memcpy_impl_~dst.offset) (select .cse16 (+ .cse15 ULTIMATE.start_memcpy_impl_~src.offset)))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse13 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ (select .cse13 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|) ULTIMATE.start_aws_byte_buf_write_~len))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0))))) (.cse7 (= c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) (.cse0 (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base))) (and (or (not .cse0) (and .cse1 (forall ((v_prenex_16 Int) (v_prenex_17 Int) (ULTIMATE.start_memcpy_impl_~dst.offset Int) (ULTIMATE.start_memcpy_impl_~src.offset Int) (ULTIMATE.start_aws_byte_buf_write_~len Int)) (or (and (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| v_prenex_16) (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8))) (not (= (mod (select (let ((.cse2 (select (let ((.cse6 (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)))) (let ((.cse5 (store (select .cse6 v_prenex_16) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| v_prenex_17))) (let ((.cse3 (store .cse6 v_prenex_16 .cse5))) (store .cse3 |c_ULTIMATE.start_bounded_malloc_#res.base| (let ((.cse4 (mod aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 18446744073709551616))) (store (select .cse3 |c_ULTIMATE.start_bounded_malloc_#res.base|) (+ .cse4 ULTIMATE.start_memcpy_impl_~dst.offset) (select .cse5 (+ .cse4 ULTIMATE.start_memcpy_impl_~src.offset)))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|) ULTIMATE.start_aws_byte_buf_write_~len))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0))))) (not .cse7)) (or (and (forall ((v_prenex_16 Int) (v_prenex_17 Int) (ULTIMATE.start_memcpy_impl_~dst.offset Int) (ULTIMATE.start_memcpy_impl_~src.offset Int) (ULTIMATE.start_aws_byte_buf_write_~len Int) (v_arrayElimCell_23 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| v_prenex_16) (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8))) (not (= (mod (select (let ((.cse8 (select (let ((.cse12 (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)))) (let ((.cse11 (store (select .cse12 v_prenex_16) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| v_prenex_17))) (let ((.cse9 (store .cse12 v_prenex_16 .cse11))) (store .cse9 v_arrayElimCell_23 (let ((.cse10 (mod aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 18446744073709551616))) (store (select .cse9 v_arrayElimCell_23) (+ .cse10 ULTIMATE.start_memcpy_impl_~dst.offset) (select .cse11 (+ .cse10 ULTIMATE.start_memcpy_impl_~src.offset)))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse8 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ (select .cse8 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|) ULTIMATE.start_aws_byte_buf_write_~len))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0)))) .cse1) (and .cse7 .cse0)))) (< aux_mod_ULTIMATE.start_memcpy_impl_~i~6_58 0))) (forall ((v_prenex_13 Int)) (or (let ((.cse19 (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse25 (or (forall ((v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2| Int) (v_DerPreprocessor_1 Int)) (not (= (mod (select (let ((.cse31 (select (let ((.cse35 (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)))) (let ((.cse34 (store (select .cse35 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| |v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2|))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| .cse34))) (store .cse32 v_DerPreprocessor_1 (let ((.cse33 (mod v_prenex_13 18446744073709551616))) (store (select .cse32 v_DerPreprocessor_1) (+ (- 18446744073709551616) v_prenex_12 .cse33) (select .cse34 (+ (- 18446744073709551616) v_prenex_14 .cse33)))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse31 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ (select .cse31 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|) v_prenex_15))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0))) (not (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8))))) (.cse18 (= c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|))) (and (or (and .cse18 .cse19) (and (forall ((v_prenex_15 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| Int) (v_prenex_14 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2| Int) (v_arrayElimCell_23 Int)) (or (not (= (mod (select (let ((.cse20 (select (let ((.cse24 (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)))) (let ((.cse23 (store (select .cse24 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| |v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2|))) (let ((.cse21 (store .cse24 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| .cse23))) (store .cse21 v_arrayElimCell_23 (let ((.cse22 (mod v_prenex_13 18446744073709551616))) (store (select .cse21 v_arrayElimCell_23) (+ (- 18446744073709551616) v_prenex_12 .cse22) (select .cse23 (+ (- 18446744073709551616) v_prenex_14 .cse22)))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse20 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ v_prenex_15 (select .cse20 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0)) (and (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8))))) .cse25)) (or (not .cse19) (and .cse25 (forall ((v_prenex_15 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| Int) (v_prenex_14 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2| Int)) (or (not (= (mod (select (let ((.cse26 (select (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)))) (let ((.cse29 (store (select .cse30 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| |v_ULTIMATE.start_aws_byte_buf_write_u8_#in~c_2|))) (let ((.cse27 (store .cse30 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6| .cse29))) (store .cse27 |c_ULTIMATE.start_bounded_malloc_#res.base| (let ((.cse28 (mod v_prenex_13 18446744073709551616))) (store (select .cse27 |c_ULTIMATE.start_bounded_malloc_#res.base|) (+ (- 18446744073709551616) v_prenex_12 .cse28) (select .cse29 (+ (- 18446744073709551616) v_prenex_14 .cse28)))))))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|))) (store .cse26 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| (+ v_prenex_15 (select .cse26 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)))) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0)) (and (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.base_6|) (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6| (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset| 8)))))) (not .cse18)))) (<= 18446744073709551616 v_prenex_13) (<= v_prenex_13 9223372036854775807)))) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c.offset_6|) (= (mod (select (select (store |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 8) v_DerPreprocessor_2)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3.offset|)) 18446744073709551616) 0))) is different from false Killed by 15