./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be16_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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_be16_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 e59944759baac4a78b3b5460ff6f3a8abaec03123fb9537d86aeca785269fb41 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:33:16,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:33:16,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:33:17,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:33:17,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:33:17,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:33:17,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:33:17,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:33:17,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:33:17,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:33:17,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:33:17,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:33:17,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:33:17,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:33:17,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:33:17,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:33:17,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:33:17,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:33:17,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:33:17,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:33:17,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:33:17,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:33:17,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:33:17,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:33:17,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:33:17,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:33:17,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:33:17,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:33:17,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:33:17,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:33:17,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:33:17,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:33:17,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:33:17,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:33:17,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:33:17,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:33:17,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:33:17,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:33:17,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:33:17,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:33:17,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:33:17,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:33:17,118 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:33:17,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:33:17,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:33:17,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:33:17,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:33:17,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:33:17,120 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:33:17,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:33:17,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:33:17,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:33:17,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:33:17,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:33:17,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:33:17,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:33:17,122 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:33:17,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:33:17,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:33:17,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:33:17,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:33:17,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:33:17,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:33:17,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:33:17,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:33:17,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:33:17,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:33:17,124 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:33:17,124 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:33:17,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:33:17,125 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:33:17,125 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 -> e59944759baac4a78b3b5460ff6f3a8abaec03123fb9537d86aeca785269fb41 [2021-11-22 19:33:17,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:33:17,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:33:17,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:33:17,370 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:33:17,371 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:33:17,372 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_be16_harness.i [2021-11-22 19:33:17,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab054766/03e9e70d2dbc43d0bfd9649732d42ac9/FLAG29a51452c [2021-11-22 19:33:18,023 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:33:18,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be16_harness.i [2021-11-22 19:33:18,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab054766/03e9e70d2dbc43d0bfd9649732d42ac9/FLAG29a51452c [2021-11-22 19:33:18,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab054766/03e9e70d2dbc43d0bfd9649732d42ac9 [2021-11-22 19:33:18,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:33:18,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:33:18,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:33:18,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:33:18,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:33:18,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:33:18" (1/1) ... [2021-11-22 19:33:18,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6cd274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:18, skipping insertion in model container [2021-11-22 19:33:18,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:33:18" (1/1) ... [2021-11-22 19:33:18,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:33:18,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:33:18,510 WARN L230 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_be16_harness.i[4497,4510] [2021-11-22 19:33:18,515 WARN L230 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_be16_harness.i[4557,4570] [2021-11-22 19:33:19,021 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,022 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,022 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,022 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,023 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,031 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,032 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,033 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,033 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,228 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:33:19,229 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:33:19,230 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:33:19,230 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:33:19,231 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:33:19,232 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:33:19,232 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:33:19,233 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:33:19,233 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:33:19,233 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:33:19,324 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:33:19,381 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,382 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:33:19,467 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:33:19,482 WARN L230 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_be16_harness.i[4497,4510] [2021-11-22 19:33:19,483 WARN L230 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_be16_harness.i[4557,4570] [2021-11-22 19:33:19,508 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,508 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,513 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,514 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,514 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,515 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,558 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:33:19,558 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:33:19,559 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:33:19,559 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:33:19,560 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:33:19,560 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:33:19,561 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:33:19,561 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:33:19,561 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:33:19,562 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:33:19,576 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:33:19,640 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,641 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:19,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:33:19,804 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:33:19,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19 WrapperNode [2021-11-22 19:33:19,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:33:19,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:33:19,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:33:19,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:33:19,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:19,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:19,972 INFO L137 Inliner]: procedures = 691, calls = 2619, calls flagged for inlining = 956, calls inlined = 44, statements flattened = 1310 [2021-11-22 19:33:19,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:33:19,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:33:19,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:33:19,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:33:19,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:19,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:19,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:19,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:20,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:20,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:20,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:20,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:33:20,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:33:20,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:33:20,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:33:20,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (1/1) ... [2021-11-22 19:33:20,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:33:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:20,096 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-22 19:33:20,101 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-22 19:33:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure htons [2021-11-22 19:33:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:33:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:33:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:33:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:33:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:33:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:33:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:33:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:33:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:33:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:33:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:33:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:33:20,355 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:33:20,356 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:33:21,189 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:33:21,198 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:33:21,199 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 19:33:21,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:33:21 BoogieIcfgContainer [2021-11-22 19:33:21,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:33:21,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:33:21,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:33:21,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:33:21,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:33:18" (1/3) ... [2021-11-22 19:33:21,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18557757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:33:21, skipping insertion in model container [2021-11-22 19:33:21,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:19" (2/3) ... [2021-11-22 19:33:21,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18557757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:33:21, skipping insertion in model container [2021-11-22 19:33:21,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:33:21" (3/3) ... [2021-11-22 19:33:21,208 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_write_be16_harness.i [2021-11-22 19:33:21,213 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:33:21,213 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-22 19:33:21,260 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:33:21,264 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-22 19:33:21,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-22 19:33:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 175 states have (on average 1.48) internal successors, (259), 186 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 19:33:21,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:21,295 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] [2021-11-22 19:33:21,296 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-22 19:33:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 733514216, now seen corresponding path program 1 times [2021-11-22 19:33:21,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:21,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874057581] [2021-11-22 19:33:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:21,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:21,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:21,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874057581] [2021-11-22 19:33:21,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874057581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:21,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:21,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:33:21,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941738763] [2021-11-22 19:33:21,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:21,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:33:21,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:21,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:33:21,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:33:21,705 INFO L87 Difference]: Start difference. First operand has 187 states, 175 states have (on average 1.48) internal successors, (259), 186 states have internal predecessors, (259), 0 states have call successors, (0), 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.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:21,747 INFO L93 Difference]: Finished difference Result 370 states and 513 transitions. [2021-11-22 19:33:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:33:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-22 19:33:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:21,759 INFO L225 Difference]: With dead ends: 370 [2021-11-22 19:33:21,759 INFO L226 Difference]: Without dead ends: 182 [2021-11-22 19:33:21,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:33:21,768 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:21,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-22 19:33:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-11-22 19:33:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 171 states have (on average 1.3567251461988303) internal successors, (232), 181 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2021-11-22 19:33:21,810 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 39 [2021-11-22 19:33:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:21,812 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2021-11-22 19:33:21,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2021-11-22 19:33:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 19:33:21,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:21,815 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] [2021-11-22 19:33:21,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:33:21,815 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-22 19:33:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 699508844, now seen corresponding path program 1 times [2021-11-22 19:33:21,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370586660] [2021-11-22 19:33:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:21,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:22,011 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-22 19:33:22,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:22,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370586660] [2021-11-22 19:33:22,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370586660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:22,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:22,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:22,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115907104] [2021-11-22 19:33:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:22,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:22,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:22,014 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:22,095 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2021-11-22 19:33:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:33:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-22 19:33:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:22,099 INFO L225 Difference]: With dead ends: 338 [2021-11-22 19:33:22,099 INFO L226 Difference]: Without dead ends: 182 [2021-11-22 19:33:22,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:22,104 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 323 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:22,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 312 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-22 19:33:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-11-22 19:33:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 181 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2021-11-22 19:33:22,118 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 39 [2021-11-22 19:33:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:22,119 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2021-11-22 19:33:22,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2021-11-22 19:33:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 19:33:22,120 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:22,120 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] [2021-11-22 19:33:22,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:33:22,121 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-22 19:33:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1277536330, now seen corresponding path program 1 times [2021-11-22 19:33:22,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:22,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716089571] [2021-11-22 19:33:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:22,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:22,235 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-22 19:33:22,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:22,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716089571] [2021-11-22 19:33:22,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716089571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:22,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:22,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:22,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967631043] [2021-11-22 19:33:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:22,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:22,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:22,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:22,238 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:22,326 INFO L93 Difference]: Finished difference Result 399 states and 510 transitions. [2021-11-22 19:33:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-22 19:33:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:22,328 INFO L225 Difference]: With dead ends: 399 [2021-11-22 19:33:22,328 INFO L226 Difference]: Without dead ends: 242 [2021-11-22 19:33:22,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:22,329 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 138 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:22,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 605 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-22 19:33:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2021-11-22 19:33:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 183 states have (on average 1.3169398907103824) internal successors, (241), 193 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-22 19:33:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 241 transitions. [2021-11-22 19:33:22,340 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 241 transitions. Word has length 51 [2021-11-22 19:33:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:22,341 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 241 transitions. [2021-11-22 19:33:22,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 241 transitions. [2021-11-22 19:33:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 19:33:22,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:22,342 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] [2021-11-22 19:33:22,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:33:22,343 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-22 19:33:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1671903116, now seen corresponding path program 1 times [2021-11-22 19:33:22,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:22,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129874558] [2021-11-22 19:33:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:22,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:22,541 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-22 19:33:22,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129874558] [2021-11-22 19:33:22,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129874558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:22,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:22,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:22,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064080764] [2021-11-22 19:33:22,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:22,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:22,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:22,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:22,543 INFO L87 Difference]: Start difference. First operand 194 states and 241 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:22,614 INFO L93 Difference]: Finished difference Result 316 states and 389 transitions. [2021-11-22 19:33:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-22 19:33:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:22,616 INFO L225 Difference]: With dead ends: 316 [2021-11-22 19:33:22,616 INFO L226 Difference]: Without dead ends: 194 [2021-11-22 19:33:22,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:22,617 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 634 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:22,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 395 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-22 19:33:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-11-22 19:33:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 193 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-22 19:33:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 238 transitions. [2021-11-22 19:33:22,622 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 238 transitions. Word has length 51 [2021-11-22 19:33:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:22,622 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 238 transitions. [2021-11-22 19:33:22,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2021-11-22 19:33:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 19:33:22,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:22,623 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] [2021-11-22 19:33:22,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:33:22,624 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-22 19:33:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 718341164, now seen corresponding path program 1 times [2021-11-22 19:33:22,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:22,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146464887] [2021-11-22 19:33:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:22,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:22,783 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-22 19:33:22,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:22,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146464887] [2021-11-22 19:33:22,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146464887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:22,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:22,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:22,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117012791] [2021-11-22 19:33:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:22,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:22,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:22,785 INFO L87 Difference]: Start difference. First operand 194 states and 238 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:22,942 INFO L93 Difference]: Finished difference Result 313 states and 370 transitions. [2021-11-22 19:33:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-22 19:33:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:22,944 INFO L225 Difference]: With dead ends: 313 [2021-11-22 19:33:22,944 INFO L226 Difference]: Without dead ends: 300 [2021-11-22 19:33:22,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:22,945 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 231 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:22,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 857 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-22 19:33:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 200. [2021-11-22 19:33:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 199 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2021-11-22 19:33:22,950 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 63 [2021-11-22 19:33:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:22,950 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2021-11-22 19:33:22,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2021-11-22 19:33:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:33:22,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:22,951 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] [2021-11-22 19:33:22,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:33:22,952 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-22 19:33:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1235696670, now seen corresponding path program 1 times [2021-11-22 19:33:22,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953679155] [2021-11-22 19:33:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:22,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:23,331 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-22 19:33:23,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953679155] [2021-11-22 19:33:23,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953679155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:23,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:23,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:23,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341715344] [2021-11-22 19:33:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:23,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:23,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:23,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:23,334 INFO L87 Difference]: Start difference. First operand 200 states and 243 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:23,737 INFO L93 Difference]: Finished difference Result 404 states and 485 transitions. [2021-11-22 19:33:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:33:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:23,738 INFO L225 Difference]: With dead ends: 404 [2021-11-22 19:33:23,738 INFO L226 Difference]: Without dead ends: 330 [2021-11-22 19:33:23,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:33:23,739 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 720 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:23,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 1041 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-22 19:33:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 219. [2021-11-22 19:33:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 208 states have (on average 1.2884615384615385) internal successors, (268), 218 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 268 transitions. [2021-11-22 19:33:23,746 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 268 transitions. Word has length 67 [2021-11-22 19:33:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:23,747 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 268 transitions. [2021-11-22 19:33:23,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 268 transitions. [2021-11-22 19:33:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:33:23,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:23,748 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] [2021-11-22 19:33:23,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:33:23,748 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-22 19:33:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1493862108, now seen corresponding path program 1 times [2021-11-22 19:33:23,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:23,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288042314] [2021-11-22 19:33:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:23,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:23,974 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-22 19:33:23,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:23,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288042314] [2021-11-22 19:33:23,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288042314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:23,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:23,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:23,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575494413] [2021-11-22 19:33:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:23,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:23,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:23,977 INFO L87 Difference]: Start difference. First operand 219 states and 268 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:24,369 INFO L93 Difference]: Finished difference Result 571 states and 694 transitions. [2021-11-22 19:33:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:24,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:33:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:24,371 INFO L225 Difference]: With dead ends: 571 [2021-11-22 19:33:24,371 INFO L226 Difference]: Without dead ends: 378 [2021-11-22 19:33:24,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:33:24,372 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 774 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:24,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 685 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-11-22 19:33:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 238. [2021-11-22 19:33:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 227 states have (on average 1.2863436123348018) internal successors, (292), 237 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-22 19:33:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2021-11-22 19:33:24,378 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 67 [2021-11-22 19:33:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:24,378 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2021-11-22 19:33:24,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2021-11-22 19:33:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:33:24,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:24,379 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] [2021-11-22 19:33:24,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:33:24,379 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-22 19:33:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -813803738, now seen corresponding path program 1 times [2021-11-22 19:33:24,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:24,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322630351] [2021-11-22 19:33:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:24,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:24,644 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-22 19:33:24,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322630351] [2021-11-22 19:33:24,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322630351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:24,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:24,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:24,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916526208] [2021-11-22 19:33:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:24,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:24,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:24,646 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:24,913 INFO L93 Difference]: Finished difference Result 475 states and 570 transitions. [2021-11-22 19:33:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:33:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:24,914 INFO L225 Difference]: With dead ends: 475 [2021-11-22 19:33:24,914 INFO L226 Difference]: Without dead ends: 341 [2021-11-22 19:33:24,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:24,915 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 532 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:24,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 753 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-22 19:33:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 238. [2021-11-22 19:33:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 227 states have (on average 1.2819383259911894) internal successors, (291), 237 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2021-11-22 19:33:24,920 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 67 [2021-11-22 19:33:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:24,920 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2021-11-22 19:33:24,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2021-11-22 19:33:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:33:24,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:24,921 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] [2021-11-22 19:33:24,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:33:24,921 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-22 19:33:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1892815656, now seen corresponding path program 1 times [2021-11-22 19:33:24,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:24,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489165878] [2021-11-22 19:33:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:24,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:25,509 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-22 19:33:25,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:25,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489165878] [2021-11-22 19:33:25,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489165878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:25,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:25,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:33:25,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060879853] [2021-11-22 19:33:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:25,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:33:25,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:33:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:25,511 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:26,714 INFO L93 Difference]: Finished difference Result 638 states and 774 transitions. [2021-11-22 19:33:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:33:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:33:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:26,716 INFO L225 Difference]: With dead ends: 638 [2021-11-22 19:33:26,716 INFO L226 Difference]: Without dead ends: 449 [2021-11-22 19:33:26,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2021-11-22 19:33:26,717 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 1374 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:26,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1374 Valid, 1883 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-22 19:33:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 323. [2021-11-22 19:33:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 312 states have (on average 1.2692307692307692) internal successors, (396), 322 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 396 transitions. [2021-11-22 19:33:26,726 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 396 transitions. Word has length 67 [2021-11-22 19:33:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:26,726 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 396 transitions. [2021-11-22 19:33:26,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 396 transitions. [2021-11-22 19:33:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:33:26,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:26,727 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] [2021-11-22 19:33:26,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:33:26,728 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-22 19:33:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 459805474, now seen corresponding path program 1 times [2021-11-22 19:33:26,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624716588] [2021-11-22 19:33:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:26,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:26,994 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-22 19:33:26,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:26,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624716588] [2021-11-22 19:33:26,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624716588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:26,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:26,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:26,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650337849] [2021-11-22 19:33:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:26,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:26,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:26,996 INFO L87 Difference]: Start difference. First operand 323 states and 396 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:27,561 INFO L93 Difference]: Finished difference Result 529 states and 635 transitions. [2021-11-22 19:33:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:27,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:33:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:27,564 INFO L225 Difference]: With dead ends: 529 [2021-11-22 19:33:27,564 INFO L226 Difference]: Without dead ends: 457 [2021-11-22 19:33:27,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:33:27,565 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 826 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:27,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 1254 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-22 19:33:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 329. [2021-11-22 19:33:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 318 states have (on average 1.270440251572327) internal successors, (404), 328 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 404 transitions. [2021-11-22 19:33:27,575 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 404 transitions. Word has length 67 [2021-11-22 19:33:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:27,575 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 404 transitions. [2021-11-22 19:33:27,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 404 transitions. [2021-11-22 19:33:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:33:27,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:27,576 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] [2021-11-22 19:33:27,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:33:27,577 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-22 19:33:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1139863844, now seen corresponding path program 1 times [2021-11-22 19:33:27,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165653045] [2021-11-22 19:33:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:27,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:27,703 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-22 19:33:27,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165653045] [2021-11-22 19:33:27,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165653045] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:27,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:27,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:27,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809081864] [2021-11-22 19:33:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:27,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:27,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:27,705 INFO L87 Difference]: Start difference. First operand 329 states and 404 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:27,974 INFO L93 Difference]: Finished difference Result 894 states and 1093 transitions. [2021-11-22 19:33:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:27,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:33:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:27,976 INFO L225 Difference]: With dead ends: 894 [2021-11-22 19:33:27,977 INFO L226 Difference]: Without dead ends: 606 [2021-11-22 19:33:27,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:27,977 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 172 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:27,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 895 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-11-22 19:33:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2021-11-22 19:33:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 380 states have (on average 1.2657894736842106) internal successors, (481), 390 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 481 transitions. [2021-11-22 19:33:27,988 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 481 transitions. Word has length 67 [2021-11-22 19:33:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:27,988 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 481 transitions. [2021-11-22 19:33:27,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 481 transitions. [2021-11-22 19:33:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-22 19:33:27,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:27,989 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] [2021-11-22 19:33:27,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:33:27,989 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:27,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1970832183, now seen corresponding path program 1 times [2021-11-22 19:33:27,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:27,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135260539] [2021-11-22 19:33:27,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:27,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:28,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:28,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135260539] [2021-11-22 19:33:28,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135260539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:28,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:28,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:28,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517081027] [2021-11-22 19:33:28,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:28,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:28,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:28,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:28,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:28,091 INFO L87 Difference]: Start difference. First operand 391 states and 481 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:28,119 INFO L93 Difference]: Finished difference Result 495 states and 601 transitions. [2021-11-22 19:33:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:28,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-22 19:33:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:28,120 INFO L225 Difference]: With dead ends: 495 [2021-11-22 19:33:28,121 INFO L226 Difference]: Without dead ends: 451 [2021-11-22 19:33:28,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:28,121 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 105 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:28,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 885 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-22 19:33:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 394. [2021-11-22 19:33:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 383 states have (on average 1.2637075718015667) internal successors, (484), 393 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 484 transitions. [2021-11-22 19:33:28,145 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 484 transitions. Word has length 68 [2021-11-22 19:33:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:28,146 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 484 transitions. [2021-11-22 19:33:28,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 484 transitions. [2021-11-22 19:33:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:28,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:28,147 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] [2021-11-22 19:33:28,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:33:28,147 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -965360329, now seen corresponding path program 1 times [2021-11-22 19:33:28,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:28,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902631467] [2021-11-22 19:33:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:28,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:28,295 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-22 19:33:28,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:28,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902631467] [2021-11-22 19:33:28,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902631467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:28,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:28,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:28,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744305603] [2021-11-22 19:33:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:28,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:28,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:28,297 INFO L87 Difference]: Start difference. First operand 394 states and 484 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:28,376 INFO L93 Difference]: Finished difference Result 426 states and 522 transitions. [2021-11-22 19:33:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:33:28,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 19:33:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:28,378 INFO L225 Difference]: With dead ends: 426 [2021-11-22 19:33:28,378 INFO L226 Difference]: Without dead ends: 424 [2021-11-22 19:33:28,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:28,379 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 272 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:28,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 611 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-11-22 19:33:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2021-11-22 19:33:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.2617801047120418) internal successors, (482), 391 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 482 transitions. [2021-11-22 19:33:28,390 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 482 transitions. Word has length 69 [2021-11-22 19:33:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:28,390 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 482 transitions. [2021-11-22 19:33:28,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 482 transitions. [2021-11-22 19:33:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:28,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:28,391 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] [2021-11-22 19:33:28,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:33:28,391 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-22 19:33:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash 608522333, now seen corresponding path program 1 times [2021-11-22 19:33:28,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:28,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083736626] [2021-11-22 19:33:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:28,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:28,524 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-22 19:33:28,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:28,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083736626] [2021-11-22 19:33:28,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083736626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:28,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:28,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:28,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496751964] [2021-11-22 19:33:28,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:28,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:28,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:28,526 INFO L87 Difference]: Start difference. First operand 392 states and 482 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:28,811 INFO L93 Difference]: Finished difference Result 583 states and 691 transitions. [2021-11-22 19:33:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:28,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 19:33:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:28,813 INFO L225 Difference]: With dead ends: 583 [2021-11-22 19:33:28,813 INFO L226 Difference]: Without dead ends: 566 [2021-11-22 19:33:28,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:28,814 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 255 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:28,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1168 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-11-22 19:33:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 396. [2021-11-22 19:33:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 386 states have (on average 1.2564766839378239) internal successors, (485), 395 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2021-11-22 19:33:28,826 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 69 [2021-11-22 19:33:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:28,826 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2021-11-22 19:33:28,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2021-11-22 19:33:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:28,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:28,827 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] [2021-11-22 19:33:28,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:33:28,828 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-22 19:33:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash -200824293, now seen corresponding path program 1 times [2021-11-22 19:33:28,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:28,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400296599] [2021-11-22 19:33:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:28,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:29,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400296599] [2021-11-22 19:33:29,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400296599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:29,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:29,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:29,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424926331] [2021-11-22 19:33:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:29,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:29,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:29,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:29,155 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:29,909 INFO L93 Difference]: Finished difference Result 1031 states and 1233 transitions. [2021-11-22 19:33:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:33:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 19:33:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:29,911 INFO L225 Difference]: With dead ends: 1031 [2021-11-22 19:33:29,911 INFO L226 Difference]: Without dead ends: 693 [2021-11-22 19:33:29,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:33:29,912 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 1145 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:29,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1145 Valid, 1189 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-11-22 19:33:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 459. [2021-11-22 19:33:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 458 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 565 transitions. [2021-11-22 19:33:29,925 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 565 transitions. Word has length 69 [2021-11-22 19:33:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:29,925 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 565 transitions. [2021-11-22 19:33:29,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 565 transitions. [2021-11-22 19:33:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 19:33:29,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:29,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] [2021-11-22 19:33:29,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:33:29,926 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-22 19:33:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1262330691, now seen corresponding path program 1 times [2021-11-22 19:33:29,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:29,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023012362] [2021-11-22 19:33:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:29,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:30,096 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-22 19:33:30,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:30,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023012362] [2021-11-22 19:33:30,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023012362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:30,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:30,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:30,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619427385] [2021-11-22 19:33:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:30,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:30,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:30,099 INFO L87 Difference]: Start difference. First operand 459 states and 565 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:30,444 INFO L93 Difference]: Finished difference Result 1096 states and 1331 transitions. [2021-11-22 19:33:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:33:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 19:33:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:30,446 INFO L225 Difference]: With dead ends: 1096 [2021-11-22 19:33:30,446 INFO L226 Difference]: Without dead ends: 808 [2021-11-22 19:33:30,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:33:30,447 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 529 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:30,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 818 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2021-11-22 19:33:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 471. [2021-11-22 19:33:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 461 states have (on average 1.2537960954446854) internal successors, (578), 470 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 578 transitions. [2021-11-22 19:33:30,460 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 578 transitions. Word has length 70 [2021-11-22 19:33:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:30,460 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 578 transitions. [2021-11-22 19:33:30,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 578 transitions. [2021-11-22 19:33:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 19:33:30,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:30,464 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] [2021-11-22 19:33:30,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:33:30,464 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-22 19:33:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash -887045666, now seen corresponding path program 1 times [2021-11-22 19:33:30,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:30,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146961773] [2021-11-22 19:33:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:30,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:30,815 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-22 19:33:30,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:30,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146961773] [2021-11-22 19:33:30,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146961773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:30,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:30,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:33:30,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053325955] [2021-11-22 19:33:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:30,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:33:30,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:30,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:33:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:33:30,817 INFO L87 Difference]: Start difference. First operand 471 states and 578 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:31,578 INFO L93 Difference]: Finished difference Result 1023 states and 1248 transitions. [2021-11-22 19:33:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 19:33:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-11-22 19:33:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:31,580 INFO L225 Difference]: With dead ends: 1023 [2021-11-22 19:33:31,581 INFO L226 Difference]: Without dead ends: 600 [2021-11-22 19:33:31,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:33:31,582 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 944 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:31,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [944 Valid, 1598 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-11-22 19:33:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 462. [2021-11-22 19:33:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 461 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 554 transitions. [2021-11-22 19:33:31,593 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 554 transitions. Word has length 71 [2021-11-22 19:33:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:31,594 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 554 transitions. [2021-11-22 19:33:31,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 554 transitions. [2021-11-22 19:33:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 19:33:31,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:31,595 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] [2021-11-22 19:33:31,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:33:31,595 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1798297, now seen corresponding path program 1 times [2021-11-22 19:33:31,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:31,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539287886] [2021-11-22 19:33:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:31,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:32,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539287886] [2021-11-22 19:33:32,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539287886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:32,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:32,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:33:32,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109686556] [2021-11-22 19:33:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:32,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:33:32,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:33:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:33:32,091 INFO L87 Difference]: Start difference. First operand 462 states and 554 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:32,572 INFO L93 Difference]: Finished difference Result 711 states and 849 transitions. [2021-11-22 19:33:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:33:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-11-22 19:33:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:32,574 INFO L225 Difference]: With dead ends: 711 [2021-11-22 19:33:32,574 INFO L226 Difference]: Without dead ends: 709 [2021-11-22 19:33:32,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:33:32,575 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 1354 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:32,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1354 Valid, 791 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-11-22 19:33:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 617. [2021-11-22 19:33:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 607 states have (on average 1.227347611202636) internal successors, (745), 616 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 745 transitions. [2021-11-22 19:33:32,592 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 745 transitions. Word has length 71 [2021-11-22 19:33:32,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:32,592 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 745 transitions. [2021-11-22 19:33:32,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 745 transitions. [2021-11-22 19:33:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 19:33:32,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:32,594 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] [2021-11-22 19:33:32,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:33:32,594 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-22 19:33:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1789575788, now seen corresponding path program 1 times [2021-11-22 19:33:32,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:32,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115684026] [2021-11-22 19:33:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:32,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:32,920 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-22 19:33:32,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:32,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115684026] [2021-11-22 19:33:32,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115684026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:32,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:32,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:33:32,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923205710] [2021-11-22 19:33:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:32,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:33:32,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:32,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:33:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:33:32,922 INFO L87 Difference]: Start difference. First operand 617 states and 745 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:35,016 INFO L93 Difference]: Finished difference Result 1298 states and 1551 transitions. [2021-11-22 19:33:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-22 19:33:35,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-11-22 19:33:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:35,019 INFO L225 Difference]: With dead ends: 1298 [2021-11-22 19:33:35,019 INFO L226 Difference]: Without dead ends: 960 [2021-11-22 19:33:35,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=724, Invalid=2032, Unknown=0, NotChecked=0, Total=2756 [2021-11-22 19:33:35,021 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 1528 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:35,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1638 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:33:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-11-22 19:33:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 660. [2021-11-22 19:33:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 650 states have (on average 1.2230769230769232) internal successors, (795), 659 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 795 transitions. [2021-11-22 19:33:35,042 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 795 transitions. Word has length 71 [2021-11-22 19:33:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:35,042 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 795 transitions. [2021-11-22 19:33:35,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 795 transitions. [2021-11-22 19:33:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 19:33:35,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:35,043 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] [2021-11-22 19:33:35,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:33:35,044 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-22 19:33:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1280102698, now seen corresponding path program 1 times [2021-11-22 19:33:35,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:35,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54566050] [2021-11-22 19:33:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:35,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:35,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-22 19:33:35,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:35,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54566050] [2021-11-22 19:33:35,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54566050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:35,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:35,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:33:35,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33692800] [2021-11-22 19:33:35,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:35,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:33:35,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:33:35,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:33:35,445 INFO L87 Difference]: Start difference. First operand 660 states and 795 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:36,058 INFO L93 Difference]: Finished difference Result 1058 states and 1267 transitions. [2021-11-22 19:33:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:33:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-11-22 19:33:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:36,060 INFO L225 Difference]: With dead ends: 1058 [2021-11-22 19:33:36,060 INFO L226 Difference]: Without dead ends: 853 [2021-11-22 19:33:36,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:33:36,061 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 1223 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:36,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1223 Valid, 1272 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-11-22 19:33:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 684. [2021-11-22 19:33:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 674 states have (on average 1.21513353115727) internal successors, (819), 683 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 819 transitions. [2021-11-22 19:33:36,079 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 819 transitions. Word has length 71 [2021-11-22 19:33:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:36,079 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 819 transitions. [2021-11-22 19:33:36,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 819 transitions. [2021-11-22 19:33:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 19:33:36,080 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:36,080 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] [2021-11-22 19:33:36,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:33:36,080 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-22 19:33:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash -308245204, now seen corresponding path program 1 times [2021-11-22 19:33:36,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195848192] [2021-11-22 19:33:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:36,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:36,200 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-22 19:33:36,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195848192] [2021-11-22 19:33:36,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195848192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:36,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:36,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:36,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599591017] [2021-11-22 19:33:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:36,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:36,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:36,202 INFO L87 Difference]: Start difference. First operand 684 states and 819 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:36,373 INFO L93 Difference]: Finished difference Result 1417 states and 1674 transitions. [2021-11-22 19:33:36,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:33:36,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-11-22 19:33:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:36,375 INFO L225 Difference]: With dead ends: 1417 [2021-11-22 19:33:36,375 INFO L226 Difference]: Without dead ends: 762 [2021-11-22 19:33:36,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:36,376 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 117 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:36,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1342 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2021-11-22 19:33:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 674. [2021-11-22 19:33:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 664 states have (on average 1.1882530120481927) internal successors, (789), 673 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 789 transitions. [2021-11-22 19:33:36,393 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 789 transitions. Word has length 71 [2021-11-22 19:33:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:36,393 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 789 transitions. [2021-11-22 19:33:36,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 789 transitions. [2021-11-22 19:33:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 19:33:36,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:36,394 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-22 19:33:36,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:33:36,394 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1728302235, now seen corresponding path program 1 times [2021-11-22 19:33:36,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:36,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455470417] [2021-11-22 19:33:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:36,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:36,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-22 19:33:36,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455470417] [2021-11-22 19:33:36,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455470417] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:36,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:36,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:36,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547585410] [2021-11-22 19:33:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:36,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:36,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:36,754 INFO L87 Difference]: Start difference. First operand 674 states and 789 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 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-22 19:33:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:37,021 INFO L93 Difference]: Finished difference Result 1017 states and 1182 transitions. [2021-11-22 19:33:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:33:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 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-22 19:33:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:37,025 INFO L225 Difference]: With dead ends: 1017 [2021-11-22 19:33:37,025 INFO L226 Difference]: Without dead ends: 610 [2021-11-22 19:33:37,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:37,026 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 468 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:37,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 887 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-11-22 19:33:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 554. [2021-11-22 19:33:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 544 states have (on average 1.1893382352941178) internal successors, (647), 553 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 647 transitions. [2021-11-22 19:33:37,042 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 647 transitions. Word has length 73 [2021-11-22 19:33:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:37,042 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 647 transitions. [2021-11-22 19:33:37,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 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-22 19:33:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 647 transitions. [2021-11-22 19:33:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:33:37,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:37,044 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] [2021-11-22 19:33:37,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:33:37,044 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-22 19:33:37,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2009726514, now seen corresponding path program 1 times [2021-11-22 19:33:37,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:37,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457819753] [2021-11-22 19:33:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:37,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:37,185 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-22 19:33:37,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:37,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457819753] [2021-11-22 19:33:37,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457819753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:37,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:37,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:37,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341795789] [2021-11-22 19:33:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:37,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:37,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:37,188 INFO L87 Difference]: Start difference. First operand 554 states and 647 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:37,426 INFO L93 Difference]: Finished difference Result 1197 states and 1380 transitions. [2021-11-22 19:33:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-22 19:33:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:37,428 INFO L225 Difference]: With dead ends: 1197 [2021-11-22 19:33:37,428 INFO L226 Difference]: Without dead ends: 693 [2021-11-22 19:33:37,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:37,429 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 432 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:37,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 436 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-11-22 19:33:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 528. [2021-11-22 19:33:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 518 states have (on average 1.1525096525096525) internal successors, (597), 527 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 597 transitions. [2021-11-22 19:33:37,448 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 597 transitions. Word has length 76 [2021-11-22 19:33:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:37,448 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 597 transitions. [2021-11-22 19:33:37,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 597 transitions. [2021-11-22 19:33:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:33:37,449 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:37,449 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] [2021-11-22 19:33:37,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:33:37,449 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-22 19:33:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1851511696, now seen corresponding path program 1 times [2021-11-22 19:33:37,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:37,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522882093] [2021-11-22 19:33:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:37,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:37,525 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-22 19:33:37,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522882093] [2021-11-22 19:33:37,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522882093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:37,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:37,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:37,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284037925] [2021-11-22 19:33:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:37,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:37,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:37,527 INFO L87 Difference]: Start difference. First operand 528 states and 597 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:37,598 INFO L93 Difference]: Finished difference Result 897 states and 1014 transitions. [2021-11-22 19:33:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-22 19:33:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:37,599 INFO L225 Difference]: With dead ends: 897 [2021-11-22 19:33:37,599 INFO L226 Difference]: Without dead ends: 377 [2021-11-22 19:33:37,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:37,601 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 27 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:37,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 575 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-22 19:33:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 353. [2021-11-22 19:33:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.151603498542274) internal successors, (395), 352 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 395 transitions. [2021-11-22 19:33:37,616 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 395 transitions. Word has length 76 [2021-11-22 19:33:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:37,616 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 395 transitions. [2021-11-22 19:33:37,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 395 transitions. [2021-11-22 19:33:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:33:37,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:37,617 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] [2021-11-22 19:33:37,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:33:37,617 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-22 19:33:37,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:37,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1592329908, now seen corresponding path program 1 times [2021-11-22 19:33:37,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:37,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80521956] [2021-11-22 19:33:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:37,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:37,972 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-22 19:33:37,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:37,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80521956] [2021-11-22 19:33:37,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80521956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:37,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:37,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 19:33:37,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44892803] [2021-11-22 19:33:37,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:37,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 19:33:37,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:37,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 19:33:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:33:37,973 INFO L87 Difference]: Start difference. First operand 353 states and 395 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:39,163 INFO L93 Difference]: Finished difference Result 647 states and 712 transitions. [2021-11-22 19:33:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-22 19:33:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-22 19:33:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:39,165 INFO L225 Difference]: With dead ends: 647 [2021-11-22 19:33:39,165 INFO L226 Difference]: Without dead ends: 576 [2021-11-22 19:33:39,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=1771, Unknown=0, NotChecked=0, Total=2162 [2021-11-22 19:33:39,167 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 1248 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:39,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1248 Valid, 2193 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:33:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-11-22 19:33:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 356. [2021-11-22 19:33:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 346 states have (on average 1.153179190751445) internal successors, (399), 355 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 399 transitions. [2021-11-22 19:33:39,188 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 399 transitions. Word has length 76 [2021-11-22 19:33:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:39,189 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 399 transitions. [2021-11-22 19:33:39,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 399 transitions. [2021-11-22 19:33:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 19:33:39,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:39,190 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] [2021-11-22 19:33:39,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:33:39,190 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-22 19:33:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1364907914, now seen corresponding path program 1 times [2021-11-22 19:33:39,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:39,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256273472] [2021-11-22 19:33:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:39,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:39,573 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-22 19:33:39,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:39,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256273472] [2021-11-22 19:33:39,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256273472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:39,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:39,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:33:39,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111069506] [2021-11-22 19:33:39,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:39,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:33:39,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:39,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:33:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:33:39,575 INFO L87 Difference]: Start difference. First operand 356 states and 399 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:40,153 INFO L93 Difference]: Finished difference Result 751 states and 835 transitions. [2021-11-22 19:33:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:33:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-22 19:33:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:40,155 INFO L225 Difference]: With dead ends: 751 [2021-11-22 19:33:40,155 INFO L226 Difference]: Without dead ends: 437 [2021-11-22 19:33:40,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-22 19:33:40,156 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 580 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:40,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 1155 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-22 19:33:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 375. [2021-11-22 19:33:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 365 states have (on average 1.1452054794520548) internal successors, (418), 374 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 418 transitions. [2021-11-22 19:33:40,167 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 418 transitions. Word has length 79 [2021-11-22 19:33:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:40,167 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 418 transitions. [2021-11-22 19:33:40,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 418 transitions. [2021-11-22 19:33:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 19:33:40,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:40,168 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] [2021-11-22 19:33:40,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:33:40,169 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-22 19:33:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1084692216, now seen corresponding path program 1 times [2021-11-22 19:33:40,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:40,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077264306] [2021-11-22 19:33:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:40,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:40,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:40,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077264306] [2021-11-22 19:33:40,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077264306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:40,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:40,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:40,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932883120] [2021-11-22 19:33:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:40,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:40,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:40,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:40,454 INFO L87 Difference]: Start difference. First operand 375 states and 418 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:41,054 INFO L93 Difference]: Finished difference Result 612 states and 676 transitions. [2021-11-22 19:33:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:33:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-22 19:33:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:41,057 INFO L225 Difference]: With dead ends: 612 [2021-11-22 19:33:41,057 INFO L226 Difference]: Without dead ends: 519 [2021-11-22 19:33:41,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:33:41,058 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 1409 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:41,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1409 Valid, 904 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-11-22 19:33:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 393. [2021-11-22 19:33:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 383 states have (on average 1.1462140992167102) internal successors, (439), 392 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 439 transitions. [2021-11-22 19:33:41,073 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 439 transitions. Word has length 79 [2021-11-22 19:33:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:41,073 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 439 transitions. [2021-11-22 19:33:41,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 439 transitions. [2021-11-22 19:33:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 19:33:41,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:41,074 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] [2021-11-22 19:33:41,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 19:33:41,074 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-22 19:33:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash -819891869, now seen corresponding path program 1 times [2021-11-22 19:33:41,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:41,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039782474] [2021-11-22 19:33:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:41,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:41,387 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-22 19:33:41,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:41,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039782474] [2021-11-22 19:33:41,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039782474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:41,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:41,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:33:41,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761868562] [2021-11-22 19:33:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:41,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:33:41,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:41,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:33:41,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:33:41,388 INFO L87 Difference]: Start difference. First operand 393 states and 439 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:41,833 INFO L93 Difference]: Finished difference Result 654 states and 727 transitions. [2021-11-22 19:33:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:33:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-22 19:33:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:41,834 INFO L225 Difference]: With dead ends: 654 [2021-11-22 19:33:41,834 INFO L226 Difference]: Without dead ends: 433 [2021-11-22 19:33:41,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:33:41,835 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 514 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:41,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 967 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-22 19:33:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 389. [2021-11-22 19:33:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.1451187335092348) internal successors, (434), 388 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 434 transitions. [2021-11-22 19:33:41,847 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 434 transitions. Word has length 82 [2021-11-22 19:33:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:41,848 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 434 transitions. [2021-11-22 19:33:41,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 434 transitions. [2021-11-22 19:33:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:41,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:41,849 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] [2021-11-22 19:33:41,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:33:41,849 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash 298498683, now seen corresponding path program 1 times [2021-11-22 19:33:41,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:41,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574426937] [2021-11-22 19:33:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:41,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:42,532 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-22 19:33:42,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:42,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574426937] [2021-11-22 19:33:42,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574426937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:42,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:42,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:42,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679220888] [2021-11-22 19:33:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:42,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:42,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:42,535 INFO L87 Difference]: Start difference. First operand 389 states and 434 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:43,139 INFO L93 Difference]: Finished difference Result 566 states and 627 transitions. [2021-11-22 19:33:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 19:33:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:43,140 INFO L225 Difference]: With dead ends: 566 [2021-11-22 19:33:43,140 INFO L226 Difference]: Without dead ends: 406 [2021-11-22 19:33:43,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:33:43,141 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 544 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:43,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 1122 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-22 19:33:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 362. [2021-11-22 19:33:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.1477272727272727) internal successors, (404), 361 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 404 transitions. [2021-11-22 19:33:43,152 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 404 transitions. Word has length 85 [2021-11-22 19:33:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:43,152 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 404 transitions. [2021-11-22 19:33:43,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 404 transitions. [2021-11-22 19:33:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:43,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:43,153 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] [2021-11-22 19:33:43,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:33:43,153 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-22 19:33:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 121635765, now seen corresponding path program 1 times [2021-11-22 19:33:43,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:43,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748116517] [2021-11-22 19:33:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:43,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:43,411 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-22 19:33:43,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748116517] [2021-11-22 19:33:43,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748116517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:43,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:43,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:43,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200808904] [2021-11-22 19:33:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:43,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:43,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:43,414 INFO L87 Difference]: Start difference. First operand 362 states and 404 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:43,790 INFO L93 Difference]: Finished difference Result 726 states and 815 transitions. [2021-11-22 19:33:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:33:43,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:43,792 INFO L225 Difference]: With dead ends: 726 [2021-11-22 19:33:43,792 INFO L226 Difference]: Without dead ends: 539 [2021-11-22 19:33:43,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:33:43,793 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 577 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:43,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 645 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-22 19:33:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 382. [2021-11-22 19:33:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 372 states have (on average 1.1397849462365592) internal successors, (424), 381 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 424 transitions. [2021-11-22 19:33:43,809 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 424 transitions. Word has length 85 [2021-11-22 19:33:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:43,809 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 424 transitions. [2021-11-22 19:33:43,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 424 transitions. [2021-11-22 19:33:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:43,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:43,810 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] [2021-11-22 19:33:43,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:33:43,811 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:43,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1466712137, now seen corresponding path program 1 times [2021-11-22 19:33:43,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:43,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394550168] [2021-11-22 19:33:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:43,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:44,135 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-22 19:33:44,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394550168] [2021-11-22 19:33:44,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394550168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:44,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:44,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:33:44,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690253275] [2021-11-22 19:33:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:44,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:33:44,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:33:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:44,137 INFO L87 Difference]: Start difference. First operand 382 states and 424 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:44,885 INFO L93 Difference]: Finished difference Result 608 states and 671 transitions. [2021-11-22 19:33:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:33:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:44,887 INFO L225 Difference]: With dead ends: 608 [2021-11-22 19:33:44,887 INFO L226 Difference]: Without dead ends: 545 [2021-11-22 19:33:44,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:33:44,887 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 797 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:44,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 1773 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-11-22 19:33:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 425. [2021-11-22 19:33:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.1349397590361445) internal successors, (471), 424 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 471 transitions. [2021-11-22 19:33:44,904 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 471 transitions. Word has length 85 [2021-11-22 19:33:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:44,904 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 471 transitions. [2021-11-22 19:33:44,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 471 transitions. [2021-11-22 19:33:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:44,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:44,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:33:44,906 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1724877575, now seen corresponding path program 1 times [2021-11-22 19:33:44,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:44,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996994861] [2021-11-22 19:33:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:44,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:45,512 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-22 19:33:45,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:45,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996994861] [2021-11-22 19:33:45,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996994861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:45,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:45,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:33:45,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669270662] [2021-11-22 19:33:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:45,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:33:45,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:45,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:33:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:33:45,514 INFO L87 Difference]: Start difference. First operand 425 states and 471 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:46,119 INFO L93 Difference]: Finished difference Result 630 states and 694 transitions. [2021-11-22 19:33:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:33:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:46,120 INFO L225 Difference]: With dead ends: 630 [2021-11-22 19:33:46,120 INFO L226 Difference]: Without dead ends: 515 [2021-11-22 19:33:46,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:33:46,121 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1086 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:46,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1086 Valid, 1596 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-11-22 19:33:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2021-11-22 19:33:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 375 states have (on average 1.1333333333333333) internal successors, (425), 384 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 425 transitions. [2021-11-22 19:33:46,143 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 425 transitions. Word has length 85 [2021-11-22 19:33:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:46,143 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 425 transitions. [2021-11-22 19:33:46,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 425 transitions. [2021-11-22 19:33:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:46,144 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:46,144 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] [2021-11-22 19:33:46,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:33:46,145 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-22 19:33:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1137079539, now seen corresponding path program 1 times [2021-11-22 19:33:46,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:46,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385647978] [2021-11-22 19:33:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:46,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:46,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:46,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385647978] [2021-11-22 19:33:46,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385647978] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:46,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:46,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:46,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283011113] [2021-11-22 19:33:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:46,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:46,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:46,398 INFO L87 Difference]: Start difference. First operand 385 states and 425 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:47,025 INFO L93 Difference]: Finished difference Result 618 states and 683 transitions. [2021-11-22 19:33:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:33:47,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:47,027 INFO L225 Difference]: With dead ends: 618 [2021-11-22 19:33:47,027 INFO L226 Difference]: Without dead ends: 545 [2021-11-22 19:33:47,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:33:47,028 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 392 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:47,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 1353 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-11-22 19:33:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 405. [2021-11-22 19:33:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 395 states have (on average 1.1341772151898735) internal successors, (448), 404 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 448 transitions. [2021-11-22 19:33:47,043 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 448 transitions. Word has length 85 [2021-11-22 19:33:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:47,043 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 448 transitions. [2021-11-22 19:33:47,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 448 transitions. [2021-11-22 19:33:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:47,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:47,044 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] [2021-11-22 19:33:47,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 19:33:47,044 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 353688179, now seen corresponding path program 1 times [2021-11-22 19:33:47,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932860601] [2021-11-22 19:33:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:47,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:47,398 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-22 19:33:47,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:47,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932860601] [2021-11-22 19:33:47,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932860601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:47,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:47,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:33:47,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865483074] [2021-11-22 19:33:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:47,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:33:47,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:33:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:33:47,399 INFO L87 Difference]: Start difference. First operand 405 states and 448 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:47,927 INFO L93 Difference]: Finished difference Result 703 states and 775 transitions. [2021-11-22 19:33:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:47,929 INFO L225 Difference]: With dead ends: 703 [2021-11-22 19:33:47,929 INFO L226 Difference]: Without dead ends: 555 [2021-11-22 19:33:47,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:33:47,930 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 612 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:47,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 1619 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-22 19:33:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 433. [2021-11-22 19:33:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 423 states have (on average 1.127659574468085) internal successors, (477), 432 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 477 transitions. [2021-11-22 19:33:47,953 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 477 transitions. Word has length 85 [2021-11-22 19:33:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:47,954 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 477 transitions. [2021-11-22 19:33:47,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 477 transitions. [2021-11-22 19:33:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:47,955 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:47,955 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] [2021-11-22 19:33:47,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 19:33:47,958 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1234659723, now seen corresponding path program 1 times [2021-11-22 19:33:47,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:47,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382827241] [2021-11-22 19:33:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:47,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:48,339 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-22 19:33:48,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:48,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382827241] [2021-11-22 19:33:48,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382827241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:48,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:48,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:33:48,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229767496] [2021-11-22 19:33:48,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:48,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:33:48,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:48,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:33:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:48,340 INFO L87 Difference]: Start difference. First operand 433 states and 477 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:49,226 INFO L93 Difference]: Finished difference Result 613 states and 672 transitions. [2021-11-22 19:33:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:33:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:49,228 INFO L225 Difference]: With dead ends: 613 [2021-11-22 19:33:49,228 INFO L226 Difference]: Without dead ends: 555 [2021-11-22 19:33:49,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2021-11-22 19:33:49,229 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 965 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:49,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [965 Valid, 2061 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-22 19:33:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 423. [2021-11-22 19:33:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.1307506053268765) internal successors, (467), 422 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 467 transitions. [2021-11-22 19:33:49,248 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 467 transitions. Word has length 85 [2021-11-22 19:33:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:49,248 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 467 transitions. [2021-11-22 19:33:49,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 467 transitions. [2021-11-22 19:33:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:33:49,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:49,249 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] [2021-11-22 19:33:49,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 19:33:49,250 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1192781619, now seen corresponding path program 1 times [2021-11-22 19:33:49,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:49,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414109187] [2021-11-22 19:33:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:49,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:49,689 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-22 19:33:49,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414109187] [2021-11-22 19:33:49,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414109187] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:49,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:49,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:49,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276055964] [2021-11-22 19:33:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:49,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:49,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:49,690 INFO L87 Difference]: Start difference. First operand 423 states and 467 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:50,136 INFO L93 Difference]: Finished difference Result 686 states and 757 transitions. [2021-11-22 19:33:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:33:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 19:33:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:50,137 INFO L225 Difference]: With dead ends: 686 [2021-11-22 19:33:50,137 INFO L226 Difference]: Without dead ends: 479 [2021-11-22 19:33:50,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:50,139 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 908 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:50,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 885 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-22 19:33:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 374. [2021-11-22 19:33:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 364 states have (on average 1.1318681318681318) internal successors, (412), 373 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 412 transitions. [2021-11-22 19:33:50,155 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 412 transitions. Word has length 85 [2021-11-22 19:33:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:50,155 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 412 transitions. [2021-11-22 19:33:50,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 412 transitions. [2021-11-22 19:33:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:33:50,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:50,156 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-22 19:33:50,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-22 19:33:50,156 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2119490476, now seen corresponding path program 1 times [2021-11-22 19:33:50,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:50,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061244775] [2021-11-22 19:33:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:50,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:50,363 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-22 19:33:50,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:50,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061244775] [2021-11-22 19:33:50,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061244775] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:50,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:50,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:50,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598589297] [2021-11-22 19:33:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:50,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:50,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:50,364 INFO L87 Difference]: Start difference. First operand 374 states and 412 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:50,894 INFO L93 Difference]: Finished difference Result 618 states and 675 transitions. [2021-11-22 19:33:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:33:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 19:33:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:50,895 INFO L225 Difference]: With dead ends: 618 [2021-11-22 19:33:50,895 INFO L226 Difference]: Without dead ends: 543 [2021-11-22 19:33:50,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:33:50,896 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 787 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:50,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 966 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-22 19:33:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 388. [2021-11-22 19:33:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 378 states have (on average 1.1296296296296295) internal successors, (427), 387 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 427 transitions. [2021-11-22 19:33:50,913 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 427 transitions. Word has length 87 [2021-11-22 19:33:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:50,914 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 427 transitions. [2021-11-22 19:33:50,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 427 transitions. [2021-11-22 19:33:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:33:50,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:50,915 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-22 19:33:50,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-22 19:33:50,915 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash -789273426, now seen corresponding path program 1 times [2021-11-22 19:33:50,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:50,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997669555] [2021-11-22 19:33:50,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:50,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:51,423 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-22 19:33:51,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997669555] [2021-11-22 19:33:51,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997669555] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:51,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:51,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 19:33:51,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175462040] [2021-11-22 19:33:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:51,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 19:33:51,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 19:33:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:33:51,424 INFO L87 Difference]: Start difference. First operand 388 states and 427 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 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-22 19:33:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:52,112 INFO L93 Difference]: Finished difference Result 551 states and 605 transitions. [2021-11-22 19:33:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 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-22 19:33:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:52,114 INFO L225 Difference]: With dead ends: 551 [2021-11-22 19:33:52,114 INFO L226 Difference]: Without dead ends: 387 [2021-11-22 19:33:52,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:33:52,120 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 875 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:52,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [875 Valid, 1785 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-11-22 19:33:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 361. [2021-11-22 19:33:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 351 states have (on average 1.1253561253561253) internal successors, (395), 360 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 395 transitions. [2021-11-22 19:33:52,165 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 395 transitions. Word has length 87 [2021-11-22 19:33:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:52,165 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 395 transitions. [2021-11-22 19:33:52,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 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-22 19:33:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 395 transitions. [2021-11-22 19:33:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:33:52,166 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:52,166 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-22 19:33:52,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-22 19:33:52,167 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash -916237800, now seen corresponding path program 1 times [2021-11-22 19:33:52,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:52,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134088439] [2021-11-22 19:33:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:52,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:52,387 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-22 19:33:52,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134088439] [2021-11-22 19:33:52,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134088439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:52,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:52,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:52,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027790311] [2021-11-22 19:33:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:52,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:52,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:52,389 INFO L87 Difference]: Start difference. First operand 361 states and 395 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 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-22 19:33:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:52,893 INFO L93 Difference]: Finished difference Result 535 states and 581 transitions. [2021-11-22 19:33:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:52,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 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-22 19:33:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:52,895 INFO L225 Difference]: With dead ends: 535 [2021-11-22 19:33:52,895 INFO L226 Difference]: Without dead ends: 468 [2021-11-22 19:33:52,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:33:52,895 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 541 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:52,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 1097 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-11-22 19:33:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 359. [2021-11-22 19:33:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 349 states have (on average 1.1232091690544412) internal successors, (392), 358 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 392 transitions. [2021-11-22 19:33:52,936 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 392 transitions. Word has length 88 [2021-11-22 19:33:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:52,936 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 392 transitions. [2021-11-22 19:33:52,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 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-22 19:33:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 392 transitions. [2021-11-22 19:33:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:33:52,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:52,937 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-22 19:33:52,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-22 19:33:52,937 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1699629160, now seen corresponding path program 1 times [2021-11-22 19:33:52,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:52,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233630100] [2021-11-22 19:33:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:52,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:53,710 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-22 19:33:53,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:53,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233630100] [2021-11-22 19:33:53,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233630100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:53,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:53,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:33:53,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451586808] [2021-11-22 19:33:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:53,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:33:53,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:53,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:33:53,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:53,711 INFO L87 Difference]: Start difference. First operand 359 states and 392 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 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-22 19:33:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:54,397 INFO L93 Difference]: Finished difference Result 593 states and 648 transitions. [2021-11-22 19:33:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 19:33:54,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 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-22 19:33:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:54,398 INFO L225 Difference]: With dead ends: 593 [2021-11-22 19:33:54,398 INFO L226 Difference]: Without dead ends: 423 [2021-11-22 19:33:54,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2021-11-22 19:33:54,399 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 816 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:54,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 1171 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-11-22 19:33:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 311. [2021-11-22 19:33:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 301 states have (on average 1.1129568106312293) internal successors, (335), 310 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-22 19:33:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 335 transitions. [2021-11-22 19:33:54,416 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 335 transitions. Word has length 88 [2021-11-22 19:33:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:54,416 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 335 transitions. [2021-11-22 19:33:54,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 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-22 19:33:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 335 transitions. [2021-11-22 19:33:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:33:54,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:54,417 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-22 19:33:54,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-22 19:33:54,417 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:54,418 INFO L85 PathProgramCache]: Analyzing trace with hash 904162516, now seen corresponding path program 1 times [2021-11-22 19:33:54,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:54,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437218669] [2021-11-22 19:33:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:54,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:55,884 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-22 19:33:55,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437218669] [2021-11-22 19:33:55,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437218669] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:55,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:55,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-22 19:33:55,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109436535] [2021-11-22 19:33:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:55,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-22 19:33:55,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-22 19:33:55,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:33:55,885 INFO L87 Difference]: Start difference. First operand 311 states and 335 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 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-22 19:33:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:58,173 INFO L93 Difference]: Finished difference Result 447 states and 484 transitions. [2021-11-22 19:33:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 19:33:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 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-22 19:33:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:58,175 INFO L225 Difference]: With dead ends: 447 [2021-11-22 19:33:58,175 INFO L226 Difference]: Without dead ends: 369 [2021-11-22 19:33:58,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 19:33:58,175 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1001 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:58,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1001 Valid, 3272 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-22 19:33:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-22 19:33:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 310. [2021-11-22 19:33:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 300 states have (on average 1.11) 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-22 19:33:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 333 transitions. [2021-11-22 19:33:58,189 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 333 transitions. Word has length 88 [2021-11-22 19:33:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:58,189 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 333 transitions. [2021-11-22 19:33:58,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 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-22 19:33:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 333 transitions. [2021-11-22 19:33:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:33:58,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:58,190 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-22 19:33:58,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-22 19:33:58,190 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash -684185386, now seen corresponding path program 1 times [2021-11-22 19:33:58,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:58,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949520151] [2021-11-22 19:33:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:58,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:59,079 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-22 19:33:59,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:59,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949520151] [2021-11-22 19:33:59,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949520151] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:59,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:59,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:33:59,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690263627] [2021-11-22 19:33:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:59,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:33:59,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:33:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:33:59,080 INFO L87 Difference]: Start difference. First operand 310 states and 333 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 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-22 19:33:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:59,567 INFO L93 Difference]: Finished difference Result 446 states and 480 transitions. [2021-11-22 19:33:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:33:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 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-22 19:33:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:59,572 INFO L225 Difference]: With dead ends: 446 [2021-11-22 19:33:59,572 INFO L226 Difference]: Without dead ends: 386 [2021-11-22 19:33:59,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:33:59,593 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 806 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:59,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 917 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-22 19:33:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 310. [2021-11-22 19:33:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 300 states have (on average 1.1066666666666667) internal successors, (332), 309 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 332 transitions. [2021-11-22 19:33:59,614 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 332 transitions. Word has length 88 [2021-11-22 19:33:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:59,614 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 332 transitions. [2021-11-22 19:33:59,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 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-22 19:33:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 332 transitions. [2021-11-22 19:33:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:33:59,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:59,615 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] [2021-11-22 19:33:59,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-22 19:33:59,616 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -64412977, now seen corresponding path program 1 times [2021-11-22 19:33:59,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:59,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570511756] [2021-11-22 19:33:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:59,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:00,452 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-22 19:34:00,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570511756] [2021-11-22 19:34:00,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570511756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:00,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:00,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-22 19:34:00,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138779612] [2021-11-22 19:34:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:00,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-22 19:34:00,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-22 19:34:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:34:00,454 INFO L87 Difference]: Start difference. First operand 310 states and 332 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:03,045 INFO L93 Difference]: Finished difference Result 676 states and 732 transitions. [2021-11-22 19:34:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-22 19:34:03,045 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-22 19:34:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:03,047 INFO L225 Difference]: With dead ends: 676 [2021-11-22 19:34:03,047 INFO L226 Difference]: Without dead ends: 672 [2021-11-22 19:34:03,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=942, Invalid=5700, Unknown=0, NotChecked=0, Total=6642 [2021-11-22 19:34:03,055 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1702 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:03,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 3426 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:34:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-11-22 19:34:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 322. [2021-11-22 19:34:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 313 states have (on average 1.1086261980830672) internal successors, (347), 321 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-22 19:34:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 347 transitions. [2021-11-22 19:34:03,073 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 347 transitions. Word has length 90 [2021-11-22 19:34:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:03,075 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 347 transitions. [2021-11-22 19:34:03,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 347 transitions. [2021-11-22 19:34:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-22 19:34:03,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:03,076 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] [2021-11-22 19:34:03,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-22 19:34:03,076 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2059414454, now seen corresponding path program 1 times [2021-11-22 19:34:03,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:03,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040818399] [2021-11-22 19:34:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:03,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:03,230 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-22 19:34:03,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040818399] [2021-11-22 19:34:03,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040818399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:03,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:03,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:34:03,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964846562] [2021-11-22 19:34:03,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:03,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:34:03,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:03,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:34:03,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:34:03,232 INFO L87 Difference]: Start difference. First operand 322 states and 347 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:03,281 INFO L93 Difference]: Finished difference Result 459 states and 497 transitions. [2021-11-22 19:34:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:34:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-22 19:34:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:03,282 INFO L225 Difference]: With dead ends: 459 [2021-11-22 19:34:03,283 INFO L226 Difference]: Without dead ends: 354 [2021-11-22 19:34:03,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:34:03,284 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 221 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:03,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 535 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:34:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-22 19:34:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2021-11-22 19:34:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 288 states have (on average 1.1041666666666667) internal successors, (318), 296 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 318 transitions. [2021-11-22 19:34:03,297 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 318 transitions. Word has length 95 [2021-11-22 19:34:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:03,297 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 318 transitions. [2021-11-22 19:34:03,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 318 transitions. [2021-11-22 19:34:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:34:03,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:03,298 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, 1] [2021-11-22 19:34:03,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-22 19:34:03,298 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -642167461, now seen corresponding path program 1 times [2021-11-22 19:34:03,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:03,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698938321] [2021-11-22 19:34:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:03,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:07,405 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-22 19:34:07,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:07,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698938321] [2021-11-22 19:34:07,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698938321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:07,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:07,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-22 19:34:07,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300295612] [2021-11-22 19:34:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:07,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-22 19:34:07,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-22 19:34:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:34:07,406 INFO L87 Difference]: Start difference. First operand 297 states and 318 transitions. Second operand has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:12,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:34:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:16,997 INFO L93 Difference]: Finished difference Result 393 states and 419 transitions. [2021-11-22 19:34:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:34:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-22 19:34:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:16,999 INFO L225 Difference]: With dead ends: 393 [2021-11-22 19:34:16,999 INFO L226 Difference]: Without dead ends: 391 [2021-11-22 19:34:17,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=412, Invalid=1310, Unknown=0, NotChecked=0, Total=1722 [2021-11-22 19:34:17,000 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 1812 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 95 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:17,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1812 Valid, 1869 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 941 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2021-11-22 19:34:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-11-22 19:34:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 299. [2021-11-22 19:34:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 290 states have (on average 1.103448275862069) internal successors, (320), 298 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-22 19:34:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 320 transitions. [2021-11-22 19:34:17,033 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 320 transitions. Word has length 97 [2021-11-22 19:34:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:17,033 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 320 transitions. [2021-11-22 19:34:17,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 320 transitions. [2021-11-22 19:34:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:34:17,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:17,034 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, 1] [2021-11-22 19:34:17,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-22 19:34:17,034 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -965477682, now seen corresponding path program 1 times [2021-11-22 19:34:17,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:17,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161217063] [2021-11-22 19:34:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:17,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:17,224 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-22 19:34:17,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161217063] [2021-11-22 19:34:17,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161217063] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:34:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955666048] [2021-11-22 19:34:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:17,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:34:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:34:17,227 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-22 19:34:17,228 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-22 19:34:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:17,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 78 conjunts are in the unsatisfiable core [2021-11-22 19:34:17,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:34:17,771 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-22 19:34:17,862 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:34:17,862 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-22 19:34:17,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-22 19:34:18,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:18,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-22 19:34:18,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-11-22 19:34:18,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:34:18,420 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-22 19:34:18,493 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:34:18,494 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 23 treesize of output 25 [2021-11-22 19:34:18,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:18,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2021-11-22 19:34:18,631 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-22 19:34:18,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:34:18,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2236 Int)) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2235) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2236) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:34:18,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2236 Int)) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2235) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2236) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:34:18,880 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1| (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2236 Int)) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2235) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2236) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0)))) is different from false [2021-11-22 19:34:18,894 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:18,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 66 [2021-11-22 19:34:18,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 83 treesize of output 79 [2021-11-22 19:34:18,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:34:18,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 6 [2021-11-22 19:34:18,949 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:18,950 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 53 treesize of output 57 [2021-11-22 19:34:20,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7| Int) (v_ArrVal_2234 Int)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7|) 0 v_ArrVal_2234)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))))) is different from false [2021-11-22 19:34:20,109 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 214 treesize of output 202 [2021-11-22 19:34:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:34:20,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955666048] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:34:20,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:34:20,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 14] total 29 [2021-11-22 19:34:20,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414884964] [2021-11-22 19:34:20,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:34:20,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-22 19:34:20,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-22 19:34:20,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=542, Unknown=4, NotChecked=196, Total=812 [2021-11-22 19:34:20,389 INFO L87 Difference]: Start difference. First operand 299 states and 320 transitions. Second operand has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:22,236 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7| Int) (v_ArrVal_2234 Int)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7|) 0 v_ArrVal_2234)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))))) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_bounded_malloc_#res#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)))) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:34:22,795 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7| Int) (v_ArrVal_2234 Int)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_7|) 0 v_ArrVal_2234)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))))) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)))) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:34:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:23,348 INFO L93 Difference]: Finished difference Result 419 states and 453 transitions. [2021-11-22 19:34:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:34:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-22 19:34:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:23,349 INFO L225 Difference]: With dead ends: 419 [2021-11-22 19:34:23,349 INFO L226 Difference]: Without dead ends: 318 [2021-11-22 19:34:23,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=136, Invalid=1004, Unknown=6, NotChecked=414, Total=1560 [2021-11-22 19:34:23,350 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 98 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 636 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:23,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 2729 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 402 Invalid, 0 Unknown, 636 Unchecked, 0.3s Time] [2021-11-22 19:34:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-11-22 19:34:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 301. [2021-11-22 19:34:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 292 states have (on average 1.1027397260273972) internal successors, (322), 300 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-22 19:34:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 322 transitions. [2021-11-22 19:34:23,365 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 322 transitions. Word has length 97 [2021-11-22 19:34:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:23,365 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 322 transitions. [2021-11-22 19:34:23,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 322 transitions. [2021-11-22 19:34:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:34:23,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:23,366 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, 1, 1] [2021-11-22 19:34:23,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 19:34:23,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-22 19:34:23,589 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1650650746, now seen corresponding path program 1 times [2021-11-22 19:34:23,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:23,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887691510] [2021-11-22 19:34:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:23,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:24,048 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-22 19:34:24,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887691510] [2021-11-22 19:34:24,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887691510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:24,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:24,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:34:24,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591540736] [2021-11-22 19:34:24,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:24,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:34:24,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:24,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:34:24,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:34:24,049 INFO L87 Difference]: Start difference. First operand 301 states and 322 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:24,774 INFO L93 Difference]: Finished difference Result 539 states and 579 transitions. [2021-11-22 19:34:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:34:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-22 19:34:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:24,775 INFO L225 Difference]: With dead ends: 539 [2021-11-22 19:34:24,775 INFO L226 Difference]: Without dead ends: 396 [2021-11-22 19:34:24,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:34:24,776 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 653 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:24,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 1372 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-22 19:34:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 340. [2021-11-22 19:34:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 331 states have (on average 1.093655589123867) internal successors, (362), 339 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 362 transitions. [2021-11-22 19:34:24,793 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 362 transitions. Word has length 98 [2021-11-22 19:34:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:24,793 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 362 transitions. [2021-11-22 19:34:24,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 362 transitions. [2021-11-22 19:34:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:34:24,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:24,794 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, 1, 1] [2021-11-22 19:34:24,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-22 19:34:24,794 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1289113914, now seen corresponding path program 1 times [2021-11-22 19:34:24,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:24,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541064631] [2021-11-22 19:34:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:24,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:26,564 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-22 19:34:26,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:26,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541064631] [2021-11-22 19:34:26,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541064631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:26,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:26,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:34:26,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980032077] [2021-11-22 19:34:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:26,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:34:26,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:26,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:34:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:34:26,566 INFO L87 Difference]: Start difference. First operand 340 states and 362 transitions. Second operand has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:27,871 INFO L93 Difference]: Finished difference Result 450 states and 481 transitions. [2021-11-22 19:34:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:34:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-22 19:34:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:27,872 INFO L225 Difference]: With dead ends: 450 [2021-11-22 19:34:27,872 INFO L226 Difference]: Without dead ends: 448 [2021-11-22 19:34:27,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:34:27,874 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 825 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:27,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 1928 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:34:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-22 19:34:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 344. [2021-11-22 19:34:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 343 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 367 transitions. [2021-11-22 19:34:27,916 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 367 transitions. Word has length 98 [2021-11-22 19:34:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:27,917 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 367 transitions. [2021-11-22 19:34:27,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 367 transitions. [2021-11-22 19:34:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:34:27,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:27,918 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, 1, 1, 1] [2021-11-22 19:34:27,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-22 19:34:27,918 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1352499709, now seen corresponding path program 1 times [2021-11-22 19:34:27,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:27,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903167416] [2021-11-22 19:34:27,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:27,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:29,003 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-22 19:34:29,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:29,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903167416] [2021-11-22 19:34:29,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903167416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:29,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:29,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:34:29,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650948592] [2021-11-22 19:34:29,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:29,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:34:29,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:34:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:34:29,004 INFO L87 Difference]: Start difference. First operand 344 states and 367 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:29,455 INFO L93 Difference]: Finished difference Result 415 states and 445 transitions. [2021-11-22 19:34:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:34:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 19:34:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:29,456 INFO L225 Difference]: With dead ends: 415 [2021-11-22 19:34:29,456 INFO L226 Difference]: Without dead ends: 413 [2021-11-22 19:34:29,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:34:29,457 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 544 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:29,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 1138 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-22 19:34:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 346. [2021-11-22 19:34:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 337 states have (on average 1.0949554896142433) internal successors, (369), 345 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 369 transitions. [2021-11-22 19:34:29,474 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 369 transitions. Word has length 99 [2021-11-22 19:34:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:29,474 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 369 transitions. [2021-11-22 19:34:29,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 369 transitions. [2021-11-22 19:34:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:34:29,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:29,475 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:29,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-22 19:34:29,476 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -397510196, now seen corresponding path program 2 times [2021-11-22 19:34:29,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:29,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631177923] [2021-11-22 19:34:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:29,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:34:29,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:29,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631177923] [2021-11-22 19:34:29,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631177923] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:34:29,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083485603] [2021-11-22 19:34:29,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 19:34:29,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:34:29,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:34:29,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:34:29,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 19:34:31,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 19:34:31,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 19:34:31,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 2790 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-22 19:34:31,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:34:32,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 19:34:32,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 19:34:32,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:32,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-22 19:34:32,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:32,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2021-11-22 19:34:32,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-22 19:34:32,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-22 19:34:32,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:34:32,709 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 19 treesize of output 9 [2021-11-22 19:34:32,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:32,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-11-22 19:34:32,779 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:34:32,779 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 22 treesize of output 24 [2021-11-22 19:34:32,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-22 19:34:32,856 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 35 treesize of output 23 [2021-11-22 19:34:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:34:32,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:34:32,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int)) (< 0 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2550) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) is different from false [2021-11-22 19:34:32,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int)) (< 0 (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2550) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) is different from false [2021-11-22 19:34:33,059 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int)) (< 0 (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2550) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:34:33,067 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int)) (< 0 (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2550) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) is different from false [2021-11-22 19:34:33,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset| v_ArrVal_2545))) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| 16))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) .cse1) 18446744073709551616) 0) (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset| v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616))))) is different from false [2021-11-22 19:34:33,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616)) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0)))) is different from false [2021-11-22 19:34:33,544 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1| (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616)) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0))))) is different from false [2021-11-22 19:34:33,561 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616)) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0))))) is different from false [2021-11-22 19:34:33,579 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|)) 18446744073709551616) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616)) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0))))) is different from false [2021-11-22 19:34:33,592 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 602 treesize of output 590 [2021-11-22 19:34:47,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2545 Int) (v_ArrVal_2536 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_2536)))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|)) (.cse7 (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|)) (.cse6 (= (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8) 0))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (and (let ((.cse2 (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse4 (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (and .cse2 (< 0 (mod (select (store (select (store .cse3 |c_ULTIMATE.start_bounded_malloc_#res#1.base| v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616)) .cse4) (and (or (not .cse2) (not .cse4)) (forall ((v_arrayElimCell_24 Int)) (< 0 (mod (select (store (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_2536)))) (store .cse5 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select .cse5 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) v_arrayElimCell_24 v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|)) 18446744073709551616)))))) (or (not .cse6) (not .cse7))) (= (mod (select (select .cse3 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (and .cse7 (forall ((v_ArrVal_2546 Int)) (< 0 (mod (select (store (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_2536)))) (store .cse8 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select .cse8 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) v_ArrVal_2546 v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|)) 18446744073709551616))) .cse6))))) is different from false [2021-11-22 19:36:37,248 INFO L354 Elim1Store]: treesize reduction 72, result has 47.1 percent of original size [2021-11-22 19:36:37,248 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 440 treesize of output 401 [2021-11-22 19:36:37,271 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:37,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 458 treesize of output 470 [2021-11-22 19:36:37,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 518 treesize of output 506 [2021-11-22 19:36:37,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:36:37,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:36:37,677 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:37,677 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 44 treesize of output 48 [2021-11-22 19:36:37,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:37,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 298 [2021-11-22 19:36:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-22 19:36:38,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083485603] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:36:38,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:36:38,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 47 [2021-11-22 19:36:38,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923961506] [2021-11-22 19:36:38,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:36:38,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-22 19:36:38,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:36:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-22 19:36:38,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1218, Unknown=22, NotChecked=790, Total=2162 [2021-11-22 19:36:38,263 INFO L87 Difference]: Start difference. First operand 346 states and 369 transitions. Second operand has 47 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 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-22 19:36:38,474 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|))) (and (or (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|)) 18446744073709551616) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse1) 18446744073709551616)) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0))))) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (not (= (select .cse2 8) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (< (+ (select .cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_bounded_malloc_#res#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0) (< (+ |c_ULTIMATE.start_bounded_malloc_#res#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|))) is different from false [2021-11-22 19:36:38,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|))) (and (let ((.cse0 (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0))) (or (and (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) (not .cse0)) (and .cse0 |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|))) (not (= (select .cse1 8) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1| (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse3 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse3) 18446744073709551616)) (= (mod (select (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse3) 18446744073709551616) 0))))) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (< (+ (select .cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:38,559 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|))) (and (not (= (select .cse0 8) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (< (+ (select .cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse2) 18446744073709551616)) (= (mod (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse2) 18446744073709551616) 0)))) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:38,563 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|))) (and (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|)) 18446744073709551616) 0)) (not (= (select .cse0 8) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (< (+ (select .cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| Int) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2546 Int) (v_ArrVal_2545 Int)) (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2545))) (.cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset|))) (or (< 0 (mod (select (store (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_8|) 0 v_ArrVal_2546)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) v_ArrVal_2549) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2550) .cse2) 18446744073709551616)) (= (mod (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse2) 18446744073709551616) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:36:41,307 INFO L93 Difference]: Finished difference Result 613 states and 658 transitions. [2021-11-22 19:36:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-22 19:36:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 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) Word has length 99 [2021-11-22 19:36:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:36:41,309 INFO L225 Difference]: With dead ends: 613 [2021-11-22 19:36:41,309 INFO L226 Difference]: Without dead ends: 528 [2021-11-22 19:36:41,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 170 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=622, Invalid=4095, Unknown=31, NotChecked=2058, Total=6806 [2021-11-22 19:36:41,313 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 932 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 5351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3012 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:36:41,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 4721 Invalid, 5351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2262 Invalid, 0 Unknown, 3012 Unchecked, 1.3s Time] [2021-11-22 19:36:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-22 19:36:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 362. [2021-11-22 19:36:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 353 states have (on average 1.093484419263456) internal successors, (386), 361 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 386 transitions. [2021-11-22 19:36:41,337 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 386 transitions. Word has length 99 [2021-11-22 19:36:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:36:41,337 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 386 transitions. [2021-11-22 19:36:41,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 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-22 19:36:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 386 transitions. [2021-11-22 19:36:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:36:41,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:36:41,338 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:36:41,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 19:36:41,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-22 19:36:41,552 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:36:41,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:36:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1830520378, now seen corresponding path program 1 times [2021-11-22 19:36:41,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:36:41,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374063943] [2021-11-22 19:36:41,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:41,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:36:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:36:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:36:42,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:36:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374063943] [2021-11-22 19:36:42,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374063943] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:36:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363246506] [2021-11-22 19:36:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:42,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:36:42,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:36:42,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:36:42,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 19:36:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:36:43,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 2787 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-22 19:36:43,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:36:43,065 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-22 19:36:43,115 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:36:43,116 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-22 19:36:43,140 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-22 19:36:43,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:36:43,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-11-22 19:36:43,340 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:36:43,340 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 23 treesize of output 22 [2021-11-22 19:36:43,511 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 20 treesize of output 8 [2021-11-22 19:36:43,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2021-11-22 19:36:43,626 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:36:43,626 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 30 treesize of output 30 [2021-11-22 19:36:43,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:36:43,695 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:43,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-11-22 19:36:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:36:43,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:36:43,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2694) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_~len#1| (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)))) (<= (mod .cse0 18446744073709551616) (mod (select (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| .cse0) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))))) is different from false [2021-11-22 19:36:43,881 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_write_#t~short1171#1| (forall ((v_ArrVal_2694 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2694) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_~len#1| (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)))) (<= (mod .cse0 18446744073709551616) (mod (select (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| .cse0) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616)))))) is different from false [2021-11-22 19:36:43,885 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 91 treesize of output 81 [2021-11-22 19:36:43,890 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:36:43,890 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 87 treesize of output 75 [2021-11-22 19:36:43,897 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:36:43,897 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 72 treesize of output 66 [2021-11-22 19:36:45,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9| Int) (v_ArrVal_2692 Int)) (or (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9| v_ArrVal_2692)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)))) is different from false [2021-11-22 19:36:45,188 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 218 treesize of output 206 [2021-11-22 19:36:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-22 19:36:45,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363246506] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:36:45,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:36:45,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 33 [2021-11-22 19:36:45,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084452376] [2021-11-22 19:36:45,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:36:45,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-22 19:36:45,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:36:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-22 19:36:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=778, Unknown=3, NotChecked=174, Total=1056 [2021-11-22 19:36:45,449 INFO L87 Difference]: Start difference. First operand 362 states and 386 transitions. Second operand has 33 states, 33 states have (on average 7.9393939393939394) internal successors, (262), 33 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:47,509 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9| Int) (v_ArrVal_2692 Int)) (or (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9| v_ArrVal_2692)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)))) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 8) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_bounded_malloc_#res#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:36:48,116 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9| Int) (v_ArrVal_2692 Int)) (or (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_9|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_9| v_ArrVal_2692)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 8) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:36:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:36:49,059 INFO L93 Difference]: Finished difference Result 531 states and 571 transitions. [2021-11-22 19:36:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 19:36:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.9393939393939394) internal successors, (262), 33 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 19:36:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:36:49,061 INFO L225 Difference]: With dead ends: 531 [2021-11-22 19:36:49,061 INFO L226 Difference]: Without dead ends: 459 [2021-11-22 19:36:49,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=189, Invalid=1386, Unknown=5, NotChecked=400, Total=1980 [2021-11-22 19:36:49,062 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 453 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 758 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:36:49,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 2858 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 696 Invalid, 0 Unknown, 758 Unchecked, 0.5s Time] [2021-11-22 19:36:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-22 19:36:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 369. [2021-11-22 19:36:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 360 states have (on average 1.0916666666666666) internal successors, (393), 368 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 393 transitions. [2021-11-22 19:36:49,106 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 393 transitions. Word has length 99 [2021-11-22 19:36:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:36:49,106 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 393 transitions. [2021-11-22 19:36:49,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.9393939393939394) internal successors, (262), 33 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 393 transitions. [2021-11-22 19:36:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 19:36:49,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:36:49,108 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, 1, 1, 1, 1] [2021-11-22 19:36:49,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 19:36:49,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:36:49,344 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:36:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:36:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1888028924, now seen corresponding path program 1 times [2021-11-22 19:36:49,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:36:49,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333628947] [2021-11-22 19:36:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:49,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:36:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:36:51,120 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-22 19:36:51,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:36:51,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333628947] [2021-11-22 19:36:51,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333628947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:36:51,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:36:51,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 19:36:51,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696118339] [2021-11-22 19:36:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:36:51,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 19:36:51,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:36:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 19:36:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:36:51,123 INFO L87 Difference]: Start difference. First operand 369 states and 393 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:36:51,917 INFO L93 Difference]: Finished difference Result 439 states and 469 transitions. [2021-11-22 19:36:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:36:51,918 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 19:36:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:36:51,919 INFO L225 Difference]: With dead ends: 439 [2021-11-22 19:36:51,919 INFO L226 Difference]: Without dead ends: 437 [2021-11-22 19:36:51,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:36:51,920 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 665 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:36:51,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [665 Valid, 920 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:36:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-22 19:36:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 371. [2021-11-22 19:36:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 362 states have (on average 1.091160220994475) internal successors, (395), 370 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 395 transitions. [2021-11-22 19:36:51,940 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 395 transitions. Word has length 100 [2021-11-22 19:36:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:36:51,941 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 395 transitions. [2021-11-22 19:36:51,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 395 transitions. [2021-11-22 19:36:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 19:36:51,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:36:51,942 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:36:51,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-22 19:36:51,943 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:36:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:36:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2114258015, now seen corresponding path program 1 times [2021-11-22 19:36:51,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:36:51,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924531089] [2021-11-22 19:36:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:51,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:36:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:36:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:36:52,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:36:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924531089] [2021-11-22 19:36:52,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924531089] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:36:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652368823] [2021-11-22 19:36:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:52,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:36:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:36:52,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:36:52,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 19:36:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:36:53,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 109 conjunts are in the unsatisfiable core [2021-11-22 19:36:53,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:36:53,339 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-22 19:36:53,406 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:36:53,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 19:36:53,435 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 20 treesize of output 16 [2021-11-22 19:36:53,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:36:53,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-22 19:36:53,843 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:36:53,844 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 31 treesize of output 26 [2021-11-22 19:36:54,042 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:36:54,042 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 36 treesize of output 34 [2021-11-22 19:36:54,065 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:36:54,066 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-11-22 19:36:54,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:36:54,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2021-11-22 19:36:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:36:54,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:36:54,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2901 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2899) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2901) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 0))) is different from false [2021-11-22 19:36:54,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2901 Int)) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse0) v_ArrVal_2899) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2901) .cse0)) 0))) is different from false [2021-11-22 19:36:54,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2896 Int) (v_ArrVal_2901 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| v_ArrVal_2901) .cse1)) 0))) is different from false [2021-11-22 19:36:54,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse1)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|))) is different from false [2021-11-22 19:36:54,507 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse1)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) is different from false [2021-11-22 19:36:54,520 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse1)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|)))) is different from false [2021-11-22 19:36:54,840 INFO L354 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2021-11-22 19:36:54,841 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 538 treesize of output 363 [2021-11-22 19:36:54,855 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:54,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 531 treesize of output 519 [2021-11-22 19:36:54,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 639 treesize of output 607 [2021-11-22 19:36:55,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:36:55,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:36:55,143 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:55,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 58 [2021-11-22 19:36:55,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:36:55,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:36:55,249 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:36:55,250 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 62 treesize of output 58 [2021-11-22 19:36:55,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:36:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-22 19:36:55,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652368823] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:36:55,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:36:55,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 23] total 46 [2021-11-22 19:36:55,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002668321] [2021-11-22 19:36:55,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:36:55,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-22 19:36:55,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:36:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-22 19:36:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1414, Unknown=6, NotChecked=486, Total=2070 [2021-11-22 19:36:55,620 INFO L87 Difference]: Start difference. First operand 371 states and 395 transitions. Second operand has 46 states, 46 states have (on average 5.739130434782608) internal successors, (264), 46 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:55,678 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 8))) (and (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse1)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|))) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base| |c_ULTIMATE.start_bounded_malloc_#res#1.base|)) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (not (= .cse2 0)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:55,680 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 8))) (and (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse1)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|))) (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (not (= .cse2 0)) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:55,751 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 8))) (and (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (or (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse2) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse2)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|)))) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:55,755 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 8))) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (or (forall ((v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| Int) (v_ArrVal_2896 Int) (|v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| Int) (v_ArrVal_2901 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10| v_ArrVal_2896)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2899)) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| v_ArrVal_2901) .cse1)) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset_10|))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.base|) 1) (not (= .cse2 0)) (= |c_ULTIMATE.start_aws_byte_buf_write_be16_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:36:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:36:56,970 INFO L93 Difference]: Finished difference Result 585 states and 630 transitions. [2021-11-22 19:36:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-22 19:36:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.739130434782608) internal successors, (264), 46 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 19:36:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:36:56,972 INFO L225 Difference]: With dead ends: 585 [2021-11-22 19:36:56,972 INFO L226 Difference]: Without dead ends: 583 [2021-11-22 19:36:56,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=598, Invalid=5284, Unknown=10, NotChecked=1590, Total=7482 [2021-11-22 19:36:56,974 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 563 mSDsluCounter, 4752 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 5004 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2041 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:36:56,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 5004 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1096 Invalid, 0 Unknown, 2041 Unchecked, 0.5s Time] [2021-11-22 19:36:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-11-22 19:36:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 372. [2021-11-22 19:36:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 363 states have (on average 1.09366391184573) internal successors, (397), 371 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 397 transitions. [2021-11-22 19:36:56,995 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 397 transitions. Word has length 101 [2021-11-22 19:36:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:36:56,995 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 397 transitions. [2021-11-22 19:36:56,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.739130434782608) internal successors, (264), 46 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 397 transitions. [2021-11-22 19:36:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 19:36:56,996 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:36:56,996 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, 1, 1, 1, 1, 1, 1] [2021-11-22 19:36:57,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 19:36:57,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:36:57,217 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:36:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:36:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1919736158, now seen corresponding path program 1 times [2021-11-22 19:36:57,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:36:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231068630] [2021-11-22 19:36:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:57,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:36:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:36:58,545 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-22 19:36:58,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:36:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231068630] [2021-11-22 19:36:58,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231068630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:36:58,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:36:58,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:36:58,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478659237] [2021-11-22 19:36:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:36:58,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:36:58,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:36:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:36:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:36:58,547 INFO L87 Difference]: Start difference. First operand 372 states and 397 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:36:59,036 INFO L93 Difference]: Finished difference Result 463 states and 497 transitions. [2021-11-22 19:36:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:36:59,036 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-22 19:36:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:36:59,037 INFO L225 Difference]: With dead ends: 463 [2021-11-22 19:36:59,037 INFO L226 Difference]: Without dead ends: 461 [2021-11-22 19:36:59,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:36:59,038 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 606 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:36:59,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 1068 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:36:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-22 19:36:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 346. [2021-11-22 19:36:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 337 states have (on average 1.0979228486646884) internal successors, (370), 345 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 370 transitions. [2021-11-22 19:36:59,057 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 370 transitions. Word has length 102 [2021-11-22 19:36:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:36:59,057 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 370 transitions. [2021-11-22 19:36:59,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:36:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 370 transitions. [2021-11-22 19:36:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 19:36:59,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:36:59,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:36:59,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-22 19:36:59,058 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:36:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:36:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash 987374703, now seen corresponding path program 1 times [2021-11-22 19:36:59,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:36:59,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526633685] [2021-11-22 19:36:59,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:36:59,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:36:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:37:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:37:00,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:37:00,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526633685] [2021-11-22 19:37:00,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526633685] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:37:00,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164851088] [2021-11-22 19:37:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:37:00,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:37:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:37:00,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:37:00,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 19:37:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:37:00,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 144 conjunts are in the unsatisfiable core [2021-11-22 19:37:00,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:37:00,999 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-22 19:37:01,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:37:01,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 19:37:01,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 19:37:01,159 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 17 treesize of output 13 [2021-11-22 19:37:01,518 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 19:37:01,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-11-22 19:37:01,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-11-22 19:37:01,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-22 19:37:01,689 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:37:01,690 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 69 treesize of output 71 [2021-11-22 19:37:01,699 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:37:01,699 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 63 treesize of output 63 [2021-11-22 19:37:01,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:37:01,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2021-11-22 19:37:01,816 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-11-22 19:37:01,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 59 [2021-11-22 19:37:01,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-11-22 19:37:02,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-11-22 19:37:02,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-22 19:37:02,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:37:02,360 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 19 treesize of output 9 [2021-11-22 19:37:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:37:02,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-11-22 19:37:02,452 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:37:02,452 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 22 treesize of output 24 [2021-11-22 19:37:02,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-22 19:37:02,557 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 35 treesize of output 23 [2021-11-22 19:37:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:37:02,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:37:02,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 Int) (v_ArrVal_3148 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_3148) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3150) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) is different from false [2021-11-22 19:37:02,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 Int) (v_ArrVal_3148 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_3148) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3150) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) is different from false [2021-11-22 19:37:02,777 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3150 Int) (v_ArrVal_3148 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_3148) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3150) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:37:02,786 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3150 Int) (v_ArrVal_3148 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_3148) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3150) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))) (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) is different from false [2021-11-22 19:37:02,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 Int) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 Int) (v_ArrVal_3148 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base| v_ArrVal_3145)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| 16))) (or (< 0 (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~#x#1.offset| v_ArrVal_3146)) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| 8)) v_ArrVal_3148) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.offset| v_ArrVal_3150) .cse1) 18446744073709551616)) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be16_~buf#1.base|) .cse1) 18446744073709551616) 0)))) is different from false [2021-11-22 19:37:06,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:37:06,832 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 142 [2021-11-22 19:37:06,867 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:37:06,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 670 treesize of output 682 [2021-11-22 19:37:06,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 858 treesize of output 830 [2021-11-22 19:37:26,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:37:34,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:37:34,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:37:34,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2021-11-22 19:37:35,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:37:35,290 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 322 treesize of output 314 Killed by 15