./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be64_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_be64_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 e695a989d07c92d21e9a41b59ca742c73a2098242f3cafca723523a39a7793cb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:33:44,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:33:44,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:33:44,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:33:44,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:33:44,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:33:44,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:33:44,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:33:44,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:33:44,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:33:44,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:33:44,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:33:44,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:33:44,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:33:44,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:33:44,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:33:44,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:33:44,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:33:44,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:33:44,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:33:44,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:33:44,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:33:44,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:33:44,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:33:44,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:33:44,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:33:44,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:33:44,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:33:44,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:33:44,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:33:44,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:33:44,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:33:44,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:33:44,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:33:44,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:33:44,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:33:44,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:33:44,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:33:44,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:33:44,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:33:44,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:33:44,858 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:44,894 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:33:44,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:33:44,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:33:44,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:33:44,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:33:44,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:33:44,897 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:33:44,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:33:44,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:33:44,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:33:44,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:33:44,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:33:44,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:33:44,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:33:44,899 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:33:44,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:33:44,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:33:44,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:33:44,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:33:44,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:33:44,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:33:44,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:33:44,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:33:44,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:33:44,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:33:44,901 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:33:44,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:33:44,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:33:44,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:33:44,902 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 -> e695a989d07c92d21e9a41b59ca742c73a2098242f3cafca723523a39a7793cb [2021-11-22 19:33:45,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:33:45,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:33:45,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:33:45,160 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:33:45,161 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:33:45,162 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_be64_harness.i [2021-11-22 19:33:45,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d478a72/3ccfd694bd3047ffae81a6db9a57db5d/FLAG72eb1c7b3 [2021-11-22 19:33:45,839 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:33:45,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_be64_harness.i [2021-11-22 19:33:45,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d478a72/3ccfd694bd3047ffae81a6db9a57db5d/FLAG72eb1c7b3 [2021-11-22 19:33:46,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9d478a72/3ccfd694bd3047ffae81a6db9a57db5d [2021-11-22 19:33:46,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:33:46,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:33:46,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:33:46,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:33:46,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:33:46,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:33:46" (1/1) ... [2021-11-22 19:33:46,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222176d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:46, skipping insertion in model container [2021-11-22 19:33:46,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:33:46" (1/1) ... [2021-11-22 19:33:46,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:33:46,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:33:46,573 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_be64_harness.i[4497,4510] [2021-11-22 19:33:46,581 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_be64_harness.i[4557,4570] [2021-11-22 19:33:47,193 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,195 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,196 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,197 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,198 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,216 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,217 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,220 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,221 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,509 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:33:47,510 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:33:47,511 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:33:47,512 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:33:47,513 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:33:47,513 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:33:47,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:33:47,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:33:47,515 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:33:47,515 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:33:47,660 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:33:47,728 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,728 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:33:47,825 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:33:47,845 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_be64_harness.i[4497,4510] [2021-11-22 19:33:47,846 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_be64_harness.i[4557,4570] [2021-11-22 19:33:47,903 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,905 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,905 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,906 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,907 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,917 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,917 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,918 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,919 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:47,958 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:33:47,959 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:33:47,960 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:33:47,960 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:33:47,961 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:33:47,961 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:33:47,962 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:33:47,962 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:33:47,963 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:33:47,963 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:33:47,986 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:33:48,034 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:48,035 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:48,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:33:48,285 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:33:48,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:48 WrapperNode [2021-11-22 19:33:48,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:33:48,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:33:48,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:33:48,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:33:48,294 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:48" (1/1) ... [2021-11-22 19:33:48,392 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:48" (1/1) ... [2021-11-22 19:33:48,475 INFO L137 Inliner]: procedures = 691, calls = 2619, calls flagged for inlining = 956, calls inlined = 45, statements flattened = 1331 [2021-11-22 19:33:48,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:33:48,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:33:48,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:33:48,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:33:48,493 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:48" (1/1) ... [2021-11-22 19:33:48,494 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:48" (1/1) ... [2021-11-22 19:33:48,505 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:48" (1/1) ... [2021-11-22 19:33:48,505 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:48" (1/1) ... [2021-11-22 19:33:48,552 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:48" (1/1) ... [2021-11-22 19:33:48,568 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:48" (1/1) ... [2021-11-22 19:33:48,576 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:48" (1/1) ... [2021-11-22 19:33:48,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:33:48,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:33:48,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:33:48,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:33:48,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:48" (1/1) ... [2021-11-22 19:33:48,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:33:48,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:48,633 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:48,652 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:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure htonl [2021-11-22 19:33:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:33:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:33:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:33:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:33:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:33:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:33:48,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:33:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:33:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:33:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:33:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:33:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:33:48,938 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:33:48,940 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:33:50,137 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:33:50,144 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:33:50,144 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 19:33:50,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:33:50 BoogieIcfgContainer [2021-11-22 19:33:50,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:33:50,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:33:50,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:33:50,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:33:50,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:33:46" (1/3) ... [2021-11-22 19:33:50,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb6e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:33:50, skipping insertion in model container [2021-11-22 19:33:50,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:48" (2/3) ... [2021-11-22 19:33:50,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb6e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:33:50, skipping insertion in model container [2021-11-22 19:33:50,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:33:50" (3/3) ... [2021-11-22 19:33:50,154 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_write_be64_harness.i [2021-11-22 19:33:50,158 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:33:50,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-22 19:33:50,204 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:33:50,216 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:50,216 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-22 19:33:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 188 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:33:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-22 19:33:50,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:50,236 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] [2021-11-22 19:33:50,237 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:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2035654772, now seen corresponding path program 1 times [2021-11-22 19:33:50,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:50,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822607004] [2021-11-22 19:33:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:50,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:50,638 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,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:50,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822607004] [2021-11-22 19:33:50,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822607004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:50,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:50,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:33:50,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676191882] [2021-11-22 19:33:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:50,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:33:50,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:50,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:33:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:33:50,670 INFO L87 Difference]: Start difference. First operand has 189 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 188 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) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:50,701 INFO L93 Difference]: Finished difference Result 374 states and 519 transitions. [2021-11-22 19:33:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:33:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-22 19:33:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:50,710 INFO L225 Difference]: With dead ends: 374 [2021-11-22 19:33:50,710 INFO L226 Difference]: Without dead ends: 184 [2021-11-22 19:33:50,714 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:50,718 INFO L933 BasicCegarLoop]: 240 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, 240 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:50,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 240 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:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-22 19:33:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-11-22 19:33:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 173 states have (on average 1.3583815028901733) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2021-11-22 19:33:50,777 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 41 [2021-11-22 19:33:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:50,778 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2021-11-22 19:33:50,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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,779 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2021-11-22 19:33:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-22 19:33:50,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:50,781 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] [2021-11-22 19:33:50,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:33:50,782 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:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash 911785488, now seen corresponding path program 1 times [2021-11-22 19:33:50,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106570859] [2021-11-22 19:33:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:50,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:50,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:50,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106570859] [2021-11-22 19:33:50,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106570859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:50,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:50,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:50,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052421997] [2021-11-22 19:33:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:50,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:50,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:50,984 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:51,079 INFO L93 Difference]: Finished difference Result 342 states and 436 transitions. [2021-11-22 19:33:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:33:51,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-22 19:33:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:51,083 INFO L225 Difference]: With dead ends: 342 [2021-11-22 19:33:51,083 INFO L226 Difference]: Without dead ends: 184 [2021-11-22 19:33:51,086 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:51,088 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 326 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 318 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.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:51,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 318 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-22 19:33:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-11-22 19:33:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 183 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:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2021-11-22 19:33:51,098 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 41 [2021-11-22 19:33:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:51,098 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2021-11-22 19:33:51,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2021-11-22 19:33:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 19:33:51,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:51,100 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] [2021-11-22 19:33:51,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:33:51,101 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:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:51,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1949548946, now seen corresponding path program 1 times [2021-11-22 19:33:51,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:51,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635381612] [2021-11-22 19:33:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:51,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:51,277 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,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:51,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635381612] [2021-11-22 19:33:51,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635381612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:51,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:51,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:51,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554623804] [2021-11-22 19:33:51,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:51,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:51,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:51,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:51,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:51,280 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:51,404 INFO L93 Difference]: Finished difference Result 403 states and 516 transitions. [2021-11-22 19:33:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 19:33:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:51,405 INFO L225 Difference]: With dead ends: 403 [2021-11-22 19:33:51,405 INFO L226 Difference]: Without dead ends: 244 [2021-11-22 19:33:51,406 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:51,407 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 129 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:51,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 625 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-22 19:33:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 196. [2021-11-22 19:33:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 185 states have (on average 1.318918918918919) internal successors, (244), 195 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2021-11-22 19:33:51,416 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 53 [2021-11-22 19:33:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:51,417 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2021-11-22 19:33:51,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2021-11-22 19:33:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 19:33:51,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:51,419 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] [2021-11-22 19:33:51,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:33:51,419 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:51,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash -920189648, now seen corresponding path program 1 times [2021-11-22 19:33:51,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:51,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395481380] [2021-11-22 19:33:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:51,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:51,613 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,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:51,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395481380] [2021-11-22 19:33:51,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395481380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:51,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:51,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:51,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96015909] [2021-11-22 19:33:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:51,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:51,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:51,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:51,616 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:51,714 INFO L93 Difference]: Finished difference Result 318 states and 392 transitions. [2021-11-22 19:33:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 19:33:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:51,715 INFO L225 Difference]: With dead ends: 318 [2021-11-22 19:33:51,716 INFO L226 Difference]: Without dead ends: 196 [2021-11-22 19:33:51,716 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:51,718 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 638 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 404 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.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:51,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 404 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-22 19:33:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-11-22 19:33:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 195 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:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2021-11-22 19:33:51,740 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 53 [2021-11-22 19:33:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:51,742 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2021-11-22 19:33:51,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2021-11-22 19:33:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 19:33:51,745 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:51,747 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] [2021-11-22 19:33:51,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:33:51,748 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:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1146198862, now seen corresponding path program 1 times [2021-11-22 19:33:51,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573452403] [2021-11-22 19:33:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:51,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:51,897 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,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:51,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573452403] [2021-11-22 19:33:51,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573452403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:51,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:51,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:51,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084167124] [2021-11-22 19:33:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:51,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:51,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:51,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:51,900 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:52,034 INFO L93 Difference]: Finished difference Result 493 states and 622 transitions. [2021-11-22 19:33:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-22 19:33:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:52,036 INFO L225 Difference]: With dead ends: 493 [2021-11-22 19:33:52,036 INFO L226 Difference]: Without dead ends: 316 [2021-11-22 19:33:52,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:52,037 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 169 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:52,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 778 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-22 19:33:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 208. [2021-11-22 19:33:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 197 states have (on average 1.284263959390863) internal successors, (253), 207 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2021-11-22 19:33:52,044 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 65 [2021-11-22 19:33:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:52,045 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2021-11-22 19:33:52,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2021-11-22 19:33:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 19:33:52,046 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:52,046 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] [2021-11-22 19:33:52,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:33:52,047 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:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1539225872, now seen corresponding path program 1 times [2021-11-22 19:33:52,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:52,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857584823] [2021-11-22 19:33:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:52,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:52,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:52,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:52,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857584823] [2021-11-22 19:33:52,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857584823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:52,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:52,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:52,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900165039] [2021-11-22 19:33:52,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:52,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:52,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:52,298 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:52,524 INFO L93 Difference]: Finished difference Result 331 states and 390 transitions. [2021-11-22 19:33:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-22 19:33:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:52,527 INFO L225 Difference]: With dead ends: 331 [2021-11-22 19:33:52,527 INFO L226 Difference]: Without dead ends: 318 [2021-11-22 19:33:52,527 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:52,528 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 234 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 872 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.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:52,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 872 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-11-22 19:33:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 214. [2021-11-22 19:33:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 203 states have (on average 1.270935960591133) internal successors, (258), 213 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 258 transitions. [2021-11-22 19:33:52,536 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 258 transitions. Word has length 65 [2021-11-22 19:33:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:52,536 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 258 transitions. [2021-11-22 19:33:52,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 258 transitions. [2021-11-22 19:33:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:52,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:52,538 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:52,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:33:52,539 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:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1637368772, now seen corresponding path program 1 times [2021-11-22 19:33:52,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680811322] [2021-11-22 19:33:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:52,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:52,875 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,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:52,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680811322] [2021-11-22 19:33:52,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680811322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:52,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:52,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:52,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419690922] [2021-11-22 19:33:52,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:52,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:52,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:52,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:52,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:52,878 INFO L87 Difference]: Start difference. First operand 214 states and 258 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:53,201 INFO L93 Difference]: Finished difference Result 461 states and 549 transitions. [2021-11-22 19:33:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:53,204 INFO L225 Difference]: With dead ends: 461 [2021-11-22 19:33:53,204 INFO L226 Difference]: Without dead ends: 334 [2021-11-22 19:33:53,204 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:53,205 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 690 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:53,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [690 Valid, 720 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-22 19:33:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2021-11-22 19:33:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 217 states have (on average 1.2672811059907834) internal successors, (275), 227 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 275 transitions. [2021-11-22 19:33:53,215 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 275 transitions. Word has length 69 [2021-11-22 19:33:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:53,215 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 275 transitions. [2021-11-22 19:33:53,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 275 transitions. [2021-11-22 19:33:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:53,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:53,218 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:53,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:33:53,218 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:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 49020870, now seen corresponding path program 1 times [2021-11-22 19:33:53,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:53,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555848276] [2021-11-22 19:33:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:53,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:53,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555848276] [2021-11-22 19:33:53,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555848276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:53,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:53,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:53,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452471743] [2021-11-22 19:33:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:53,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:53,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:53,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:53,629 INFO L87 Difference]: Start difference. First operand 228 states and 275 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:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:54,367 INFO L93 Difference]: Finished difference Result 492 states and 586 transitions. [2021-11-22 19:33:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:54,368 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:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:54,369 INFO L225 Difference]: With dead ends: 492 [2021-11-22 19:33:54,369 INFO L226 Difference]: Without dead ends: 356 [2021-11-22 19:33:54,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:33:54,370 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 1038 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:54,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 1100 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:33:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-22 19:33:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 245. [2021-11-22 19:33:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2692307692307692) internal successors, (297), 244 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2021-11-22 19:33:54,378 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 69 [2021-11-22 19:33:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:54,378 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2021-11-22 19:33:54,379 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:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2021-11-22 19:33:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:54,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:54,380 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:54,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:33:54,380 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:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 729079240, now seen corresponding path program 1 times [2021-11-22 19:33:54,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:54,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695185033] [2021-11-22 19:33:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:54,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:54,607 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:54,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:54,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695185033] [2021-11-22 19:33:54,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695185033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:54,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:54,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:54,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533927425] [2021-11-22 19:33:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:54,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:54,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:54,610 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:54,906 INFO L93 Difference]: Finished difference Result 615 states and 741 transitions. [2021-11-22 19:33:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:54,909 INFO L225 Difference]: With dead ends: 615 [2021-11-22 19:33:54,909 INFO L226 Difference]: Without dead ends: 394 [2021-11-22 19:33:54,909 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:54,910 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 329 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:54,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 781 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-22 19:33:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 266. [2021-11-22 19:33:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 255 states have (on average 1.2470588235294118) internal successors, (318), 265 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:33:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 318 transitions. [2021-11-22 19:33:54,919 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 318 transitions. Word has length 69 [2021-11-22 19:33:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:54,920 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 318 transitions. [2021-11-22 19:33:54,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 318 transitions. [2021-11-22 19:33:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:54,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:54,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, 1, 1] [2021-11-22 19:33:54,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:33:54,921 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:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1482031052, now seen corresponding path program 1 times [2021-11-22 19:33:54,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052504262] [2021-11-22 19:33:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:54,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:55,169 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,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052504262] [2021-11-22 19:33:55,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052504262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:55,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:55,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:55,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463126551] [2021-11-22 19:33:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:55,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:55,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:55,172 INFO L87 Difference]: Start difference. First operand 266 states and 318 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:55,191 INFO L93 Difference]: Finished difference Result 464 states and 553 transitions. [2021-11-22 19:33:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:33:55,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:55,194 INFO L225 Difference]: With dead ends: 464 [2021-11-22 19:33:55,194 INFO L226 Difference]: Without dead ends: 266 [2021-11-22 19:33:55,195 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:55,196 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 160 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:55,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 514 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-22 19:33:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-22 19:33:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 255 states have (on average 1.2431372549019608) internal successors, (317), 265 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 317 transitions. [2021-11-22 19:33:55,205 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 317 transitions. Word has length 69 [2021-11-22 19:33:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:55,205 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 317 transitions. [2021-11-22 19:33:55,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 317 transitions. [2021-11-22 19:33:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:33:55,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:55,207 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:55,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:33:55,207 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:55,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1756790666, now seen corresponding path program 1 times [2021-11-22 19:33:55,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:55,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595376055] [2021-11-22 19:33:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:55,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:55,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:55,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:55,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595376055] [2021-11-22 19:33:55,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595376055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:55,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:55,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:55,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529968785] [2021-11-22 19:33:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:55,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:55,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:55,647 INFO L87 Difference]: Start difference. First operand 266 states and 317 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:56,045 INFO L93 Difference]: Finished difference Result 563 states and 675 transitions. [2021-11-22 19:33:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:33:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:56,047 INFO L225 Difference]: With dead ends: 563 [2021-11-22 19:33:56,047 INFO L226 Difference]: Without dead ends: 329 [2021-11-22 19:33:56,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:56,048 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 741 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:56,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 948 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-11-22 19:33:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 269. [2021-11-22 19:33:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 258 states have (on average 1.244186046511628) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 321 transitions. [2021-11-22 19:33:56,057 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 321 transitions. Word has length 69 [2021-11-22 19:33:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:56,058 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 321 transitions. [2021-11-22 19:33:56,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 321 transitions. [2021-11-22 19:33:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:33:56,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:56,059 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:56,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:33:56,059 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1589544943, now seen corresponding path program 1 times [2021-11-22 19:33:56,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:56,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888339470] [2021-11-22 19:33:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:56,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:56,700 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:56,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:56,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888339470] [2021-11-22 19:33:56,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888339470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:56,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:56,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:33:56,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876108644] [2021-11-22 19:33:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:56,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:33:56,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:33:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:33:56,703 INFO L87 Difference]: Start difference. First operand 269 states and 321 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:59,209 INFO L93 Difference]: Finished difference Result 940 states and 1130 transitions. [2021-11-22 19:33:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-22 19:33:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:59,212 INFO L225 Difference]: With dead ends: 940 [2021-11-22 19:33:59,212 INFO L226 Difference]: Without dead ends: 725 [2021-11-22 19:33:59,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=504, Invalid=2358, Unknown=0, NotChecked=0, Total=2862 [2021-11-22 19:33:59,214 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 1744 mSDsluCounter, 3939 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:59,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1744 Valid, 4344 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-22 19:33:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-11-22 19:33:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 365. [2021-11-22 19:33:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 354 states have (on average 1.2401129943502824) internal successors, (439), 364 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:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 439 transitions. [2021-11-22 19:33:59,229 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 439 transitions. Word has length 76 [2021-11-22 19:33:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:59,230 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 439 transitions. [2021-11-22 19:33:59,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 439 transitions. [2021-11-22 19:33:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 19:33:59,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:59,231 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:59,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:33:59,232 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:33:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash -372029715, now seen corresponding path program 1 times [2021-11-22 19:33:59,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420592262] [2021-11-22 19:33:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:59,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:59,557 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,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420592262] [2021-11-22 19:33:59,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420592262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:59,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:59,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:33:59,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637421944] [2021-11-22 19:33:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:59,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:33:59,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:33:59,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:33:59,559 INFO L87 Difference]: Start difference. First operand 365 states and 439 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:34:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:00,345 INFO L93 Difference]: Finished difference Result 718 states and 866 transitions. [2021-11-22 19:34:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:34:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:34:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:00,348 INFO L225 Difference]: With dead ends: 718 [2021-11-22 19:34:00,348 INFO L226 Difference]: Without dead ends: 505 [2021-11-22 19:34:00,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:34:00,349 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 459 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:00,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1842 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:34:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-11-22 19:34:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 363. [2021-11-22 19:34:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 352 states have (on average 1.2357954545454546) internal successors, (435), 362 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 435 transitions. [2021-11-22 19:34:00,365 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 435 transitions. Word has length 76 [2021-11-22 19:34:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:00,365 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 435 transitions. [2021-11-22 19:34:00,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:34:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 435 transitions. [2021-11-22 19:34:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 19:34:00,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:00,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:00,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:34:00,367 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:34:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1700489080, now seen corresponding path program 1 times [2021-11-22 19:34:00,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:00,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862641243] [2021-11-22 19:34:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:00,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:00,555 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,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:00,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862641243] [2021-11-22 19:34:00,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862641243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:00,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:00,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:34:00,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826297556] [2021-11-22 19:34:00,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:00,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:34:00,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:00,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:34:00,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:34:00,557 INFO L87 Difference]: Start difference. First operand 363 states and 435 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:00,751 INFO L93 Difference]: Finished difference Result 784 states and 922 transitions. [2021-11-22 19:34:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:34:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-22 19:34:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:00,753 INFO L225 Difference]: With dead ends: 784 [2021-11-22 19:34:00,753 INFO L226 Difference]: Without dead ends: 427 [2021-11-22 19:34:00,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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:34:00,754 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 120 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:00,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 1349 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-22 19:34:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 359. [2021-11-22 19:34:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 348 states have (on average 1.2155172413793103) internal successors, (423), 358 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 423 transitions. [2021-11-22 19:34:00,768 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 423 transitions. Word has length 77 [2021-11-22 19:34:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:00,768 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 423 transitions. [2021-11-22 19:34:00,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 423 transitions. [2021-11-22 19:34:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:34:00,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:00,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:00,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:34:00,770 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:34:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash 563335530, now seen corresponding path program 1 times [2021-11-22 19:34:00,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:00,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490466789] [2021-11-22 19:34:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:00,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:01,031 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:01,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:01,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490466789] [2021-11-22 19:34:01,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490466789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:01,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:01,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:34:01,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451911493] [2021-11-22 19:34:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:01,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:34:01,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:34:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:34:01,034 INFO L87 Difference]: Start difference. First operand 359 states and 423 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:01,778 INFO L93 Difference]: Finished difference Result 746 states and 870 transitions. [2021-11-22 19:34:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:34:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:34:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:01,780 INFO L225 Difference]: With dead ends: 746 [2021-11-22 19:34:01,780 INFO L226 Difference]: Without dead ends: 394 [2021-11-22 19:34:01,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:34:01,781 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 481 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:01,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 1036 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:34:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-22 19:34:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 264. [2021-11-22 19:34:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 253 states have (on average 1.1976284584980237) internal successors, (303), 263 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2021-11-22 19:34:01,794 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 81 [2021-11-22 19:34:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:01,794 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2021-11-22 19:34:01,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2021-11-22 19:34:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:34:01,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:01,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:01,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:34:01,796 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:34:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1390225900, now seen corresponding path program 1 times [2021-11-22 19:34:01,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:01,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968206292] [2021-11-22 19:34:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:01,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:01,996 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:01,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:01,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968206292] [2021-11-22 19:34:01,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968206292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:01,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:01,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:34:01,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069153824] [2021-11-22 19:34:01,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:01,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:34:01,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:01,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:34:02,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:34:02,000 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:02,232 INFO L93 Difference]: Finished difference Result 579 states and 658 transitions. [2021-11-22 19:34:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:34:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:34:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:02,234 INFO L225 Difference]: With dead ends: 579 [2021-11-22 19:34:02,234 INFO L226 Difference]: Without dead ends: 326 [2021-11-22 19:34:02,234 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:34:02,235 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 333 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:02,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 444 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-11-22 19:34:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 239. [2021-11-22 19:34:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 228 states have (on average 1.1710526315789473) internal successors, (267), 238 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2021-11-22 19:34:02,246 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 81 [2021-11-22 19:34:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:02,246 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2021-11-22 19:34:02,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2021-11-22 19:34:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:34:02,247 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:02,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:02,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:34:02,248 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:34:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1243591532, now seen corresponding path program 1 times [2021-11-22 19:34:02,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83704417] [2021-11-22 19:34:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:02,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:02,742 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:02,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:02,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83704417] [2021-11-22 19:34:02,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83704417] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:02,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:02,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:34:02,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157401872] [2021-11-22 19:34:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:02,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:34:02,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:34:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:34:02,744 INFO L87 Difference]: Start difference. First operand 239 states and 267 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:03,438 INFO L93 Difference]: Finished difference Result 520 states and 575 transitions. [2021-11-22 19:34:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:34:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:34:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:03,440 INFO L225 Difference]: With dead ends: 520 [2021-11-22 19:34:03,440 INFO L226 Difference]: Without dead ends: 312 [2021-11-22 19:34:03,440 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:34:03,441 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 766 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:03,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 1053 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:34:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-11-22 19:34:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 258. [2021-11-22 19:34:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 247 states have (on average 1.1578947368421053) internal successors, (286), 257 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 286 transitions. [2021-11-22 19:34:03,451 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 286 transitions. Word has length 81 [2021-11-22 19:34:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:03,451 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 286 transitions. [2021-11-22 19:34:03,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 286 transitions. [2021-11-22 19:34:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:34:03,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:03,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:03,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:34:03,453 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 819944810, now seen corresponding path program 1 times [2021-11-22 19:34:03,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:03,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086522841] [2021-11-22 19:34:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:03,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:03,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086522841] [2021-11-22 19:34:03,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086522841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:03,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:03,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:34:03,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622835675] [2021-11-22 19:34:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:03,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:34:03,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:34:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:34:03,910 INFO L87 Difference]: Start difference. First operand 258 states and 286 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:04,581 INFO L93 Difference]: Finished difference Result 481 states and 532 transitions. [2021-11-22 19:34:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:34:04,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:34:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:04,583 INFO L225 Difference]: With dead ends: 481 [2021-11-22 19:34:04,583 INFO L226 Difference]: Without dead ends: 393 [2021-11-22 19:34:04,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2021-11-22 19:34:04,584 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 1521 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:04,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 895 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-11-22 19:34:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 278. [2021-11-22 19:34:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 267 states have (on average 1.1610486891385767) internal successors, (310), 277 states have internal predecessors, (310), 0 states have call successors, (0), 0 states 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:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 310 transitions. [2021-11-22 19:34:04,596 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 310 transitions. Word has length 81 [2021-11-22 19:34:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:04,596 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 310 transitions. [2021-11-22 19:34:04,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 310 transitions. [2021-11-22 19:34:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:34:04,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:04,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:04,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:34:04,598 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:34:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1078110248, now seen corresponding path program 1 times [2021-11-22 19:34:04,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:04,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490104440] [2021-11-22 19:34:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:04,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:04,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490104440] [2021-11-22 19:34:04,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490104440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:04,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:04,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:34:04,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199402263] [2021-11-22 19:34:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:04,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:34:04,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:34:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:34:04,880 INFO L87 Difference]: Start difference. First operand 278 states and 310 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:05,336 INFO L93 Difference]: Finished difference Result 460 states and 509 transitions. [2021-11-22 19:34:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:34:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:34:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:05,338 INFO L225 Difference]: With dead ends: 460 [2021-11-22 19:34:05,338 INFO L226 Difference]: Without dead ends: 381 [2021-11-22 19:34:05,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:34:05,339 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 848 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:05,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [848 Valid, 972 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:34:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-22 19:34:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 278. [2021-11-22 19:34:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 267 states have (on average 1.1573033707865168) internal successors, (309), 277 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 309 transitions. [2021-11-22 19:34:05,350 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 309 transitions. Word has length 81 [2021-11-22 19:34:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:05,350 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 309 transitions. [2021-11-22 19:34:05,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 309 transitions. [2021-11-22 19:34:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 19:34:05,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:05,351 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:34:05,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:34:05,351 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -870090034, now seen corresponding path program 1 times [2021-11-22 19:34:05,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:05,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350039646] [2021-11-22 19:34:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:05,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:05,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:05,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350039646] [2021-11-22 19:34:05,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350039646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:05,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:05,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:34:05,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763343166] [2021-11-22 19:34:05,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:05,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:34:05,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:34:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:34:05,469 INFO L87 Difference]: Start difference. First operand 278 states and 309 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:34:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:05,499 INFO L93 Difference]: Finished difference Result 370 states and 411 transitions. [2021-11-22 19:34:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:34:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:34:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:05,501 INFO L225 Difference]: With dead ends: 370 [2021-11-22 19:34:05,501 INFO L226 Difference]: Without dead ends: 332 [2021-11-22 19:34:05,502 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:34:05,503 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 105 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 845 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:34:05,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 845 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:34:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-22 19:34:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 281. [2021-11-22 19:34:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 270 states have (on average 1.1555555555555554) internal successors, (312), 280 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 312 transitions. [2021-11-22 19:34:05,516 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 312 transitions. Word has length 82 [2021-11-22 19:34:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:05,517 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 312 transitions. [2021-11-22 19:34:05,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:34:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 312 transitions. [2021-11-22 19:34:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:34:05,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:05,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:05,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:34:05,518 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:34:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 371790591, now seen corresponding path program 1 times [2021-11-22 19:34:05,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931944655] [2021-11-22 19:34:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:05,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:05,669 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:05,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:05,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931944655] [2021-11-22 19:34:05,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931944655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:05,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:05,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:34:05,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670505073] [2021-11-22 19:34:05,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:05,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:34:05,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:05,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:34:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:34:05,673 INFO L87 Difference]: Start difference. First operand 281 states and 312 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:05,983 INFO L93 Difference]: Finished difference Result 412 states and 453 transitions. [2021-11-22 19:34:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:34:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-22 19:34:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:05,984 INFO L225 Difference]: With dead ends: 412 [2021-11-22 19:34:05,984 INFO L226 Difference]: Without dead ends: 395 [2021-11-22 19:34:05,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:34:05,985 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 246 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:05,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 1113 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-11-22 19:34:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 285. [2021-11-22 19:34:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 274 states have (on average 1.1496350364963503) internal successors, (315), 284 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 315 transitions. [2021-11-22 19:34:05,998 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 315 transitions. Word has length 83 [2021-11-22 19:34:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:05,998 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 315 transitions. [2021-11-22 19:34:05,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 315 transitions. [2021-11-22 19:34:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:34:05,999 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:05,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:06,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:34:06,000 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash -437556035, now seen corresponding path program 1 times [2021-11-22 19:34:06,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642516617] [2021-11-22 19:34:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:06,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:06,298 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:06,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:06,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642516617] [2021-11-22 19:34:06,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642516617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:06,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:06,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:34:06,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921879123] [2021-11-22 19:34:06,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:06,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:34:06,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:06,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:34:06,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:34:06,300 INFO L87 Difference]: Start difference. First operand 285 states and 315 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:07,596 INFO L93 Difference]: Finished difference Result 500 states and 542 transitions. [2021-11-22 19:34:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-22 19:34:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-22 19:34:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:07,600 INFO L225 Difference]: With dead ends: 500 [2021-11-22 19:34:07,600 INFO L226 Difference]: Without dead ends: 437 [2021-11-22 19:34:07,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2021-11-22 19:34:07,601 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 1135 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:07,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1135 Valid, 1054 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:34:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-22 19:34:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 286. [2021-11-22 19:34:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.1490909090909092) internal successors, (316), 285 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 316 transitions. [2021-11-22 19:34:07,615 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 316 transitions. Word has length 83 [2021-11-22 19:34:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:07,616 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 316 transitions. [2021-11-22 19:34:07,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 316 transitions. [2021-11-22 19:34:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:34:07,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:07,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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:07,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:34:07,617 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1202092071, now seen corresponding path program 1 times [2021-11-22 19:34:07,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:07,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998766343] [2021-11-22 19:34:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:07,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:07,817 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,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:07,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998766343] [2021-11-22 19:34:07,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998766343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:07,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:07,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:34:07,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004729932] [2021-11-22 19:34:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:07,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:34:07,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:07,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:34:07,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:34:07,821 INFO L87 Difference]: Start difference. First operand 286 states and 316 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:07,918 INFO L93 Difference]: Finished difference Result 312 states and 344 transitions. [2021-11-22 19:34:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:34:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-22 19:34:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:07,919 INFO L225 Difference]: With dead ends: 312 [2021-11-22 19:34:07,920 INFO L226 Difference]: Without dead ends: 310 [2021-11-22 19:34:07,920 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:34:07,921 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 404 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:07,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 572 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:34:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-22 19:34:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 284. [2021-11-22 19:34:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 274 states have (on average 1.145985401459854) internal successors, (314), 283 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 314 transitions. [2021-11-22 19:34:07,932 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 314 transitions. Word has length 83 [2021-11-22 19:34:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:07,933 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 314 transitions. [2021-11-22 19:34:07,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 314 transitions. [2021-11-22 19:34:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:34:07,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:07,934 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:34:07,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:34:07,934 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash 135861147, now seen corresponding path program 1 times [2021-11-22 19:34:07,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:07,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448660505] [2021-11-22 19:34:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:07,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:08,595 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:08,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:08,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448660505] [2021-11-22 19:34:08,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448660505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:08,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:08,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:34:08,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505593637] [2021-11-22 19:34:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:08,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:34:08,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:34:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:34:08,597 INFO L87 Difference]: Start difference. First operand 284 states and 314 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:34:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:09,083 INFO L93 Difference]: Finished difference Result 486 states and 537 transitions. [2021-11-22 19:34:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:34:09,084 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:34:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:09,086 INFO L225 Difference]: With dead ends: 486 [2021-11-22 19:34:09,086 INFO L226 Difference]: Without dead ends: 484 [2021-11-22 19:34:09,086 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:34:09,087 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 1038 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:09,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 780 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:34:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-11-22 19:34:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 392. [2021-11-22 19:34:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.1413612565445026) internal successors, (436), 391 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 436 transitions. [2021-11-22 19:34:09,105 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 436 transitions. Word has length 85 [2021-11-22 19:34:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:09,105 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 436 transitions. [2021-11-22 19:34:09,106 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:34:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 436 transitions. [2021-11-22 19:34:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:34:09,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:09,107 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:34:09,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:34:09,107 INFO L402 AbstractCegarLoop]: === Iteration 25 === 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:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1713682429, now seen corresponding path program 1 times [2021-11-22 19:34:09,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:09,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796484147] [2021-11-22 19:34:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:09,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:10,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:34:10,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:10,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796484147] [2021-11-22 19:34:10,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796484147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:10,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:10,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:34:10,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613862733] [2021-11-22 19:34:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:10,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:34:10,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:34:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:34:10,081 INFO L87 Difference]: Start difference. First operand 392 states and 436 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:11,043 INFO L93 Difference]: Finished difference Result 667 states and 738 transitions. [2021-11-22 19:34:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:34:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 19:34:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:11,045 INFO L225 Difference]: With dead ends: 667 [2021-11-22 19:34:11,045 INFO L226 Difference]: Without dead ends: 507 [2021-11-22 19:34:11,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2021-11-22 19:34:11,047 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 846 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:11,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [846 Valid, 1740 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:34:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-11-22 19:34:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 377. [2021-11-22 19:34:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 367 states have (on average 1.1444141689373297) internal successors, (420), 376 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 420 transitions. [2021-11-22 19:34:11,065 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 420 transitions. Word has length 87 [2021-11-22 19:34:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:11,065 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 420 transitions. [2021-11-22 19:34:11,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 420 transitions. [2021-11-22 19:34:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:34:11,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:11,067 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:34:11,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:34:11,067 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:34:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash -154356109, now seen corresponding path program 1 times [2021-11-22 19:34:11,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:11,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179854529] [2021-11-22 19:34:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:11,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:11,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:11,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179854529] [2021-11-22 19:34:11,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179854529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:11,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:11,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:34:11,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742484028] [2021-11-22 19:34:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:11,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:34:11,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:34:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:34:11,362 INFO L87 Difference]: Start difference. First operand 377 states and 420 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:34:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:11,752 INFO L93 Difference]: Finished difference Result 759 states and 853 transitions. [2021-11-22 19:34:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:34:11,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:34:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:11,756 INFO L225 Difference]: With dead ends: 759 [2021-11-22 19:34:11,756 INFO L226 Difference]: Without dead ends: 560 [2021-11-22 19:34:11,756 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:34:11,759 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 403 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:11,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 931 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:34:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-11-22 19:34:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 397. [2021-11-22 19:34:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 387 states have (on average 1.1369509043927648) internal successors, (440), 396 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 440 transitions. [2021-11-22 19:34:11,784 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 440 transitions. Word has length 87 [2021-11-22 19:34:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:11,784 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 440 transitions. [2021-11-22 19:34:11,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:34:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 440 transitions. [2021-11-22 19:34:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:34:11,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:11,798 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:34:11,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:34:11,799 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:34:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1742704011, now seen corresponding path program 1 times [2021-11-22 19:34:11,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759593486] [2021-11-22 19:34:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:11,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:12,316 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:12,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759593486] [2021-11-22 19:34:12,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759593486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:12,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:12,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-22 19:34:12,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615009047] [2021-11-22 19:34:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:12,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 19:34:12,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:12,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 19:34:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:34:12,319 INFO L87 Difference]: Start difference. First operand 397 states and 440 transitions. Second operand has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 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:34:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:13,738 INFO L93 Difference]: Finished difference Result 663 states and 728 transitions. [2021-11-22 19:34:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-22 19:34:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 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:34:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:13,744 INFO L225 Difference]: With dead ends: 663 [2021-11-22 19:34:13,744 INFO L226 Difference]: Without dead ends: 605 [2021-11-22 19:34:13,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2021-11-22 19:34:13,746 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 1298 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:13,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1298 Valid, 1965 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:34:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-22 19:34:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 447. [2021-11-22 19:34:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 437 states have (on average 1.1304347826086956) internal successors, (494), 446 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 494 transitions. [2021-11-22 19:34:13,768 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 494 transitions. Word has length 87 [2021-11-22 19:34:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:13,769 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 494 transitions. [2021-11-22 19:34:13,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 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:34:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 494 transitions. [2021-11-22 19:34:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:34:13,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:13,770 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:34:13,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 19:34:13,770 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:34:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -309693829, now seen corresponding path program 1 times [2021-11-22 19:34:13,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:13,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129161341] [2021-11-22 19:34:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:13,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:14,847 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:14,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:14,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129161341] [2021-11-22 19:34:14,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129161341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:14,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:14,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:34:14,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227639796] [2021-11-22 19:34:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:14,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:34:14,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:34:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:34:14,849 INFO L87 Difference]: Start difference. First operand 447 states and 494 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:15,374 INFO L93 Difference]: Finished difference Result 656 states and 721 transitions. [2021-11-22 19:34:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:34:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 19:34:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:15,376 INFO L225 Difference]: With dead ends: 656 [2021-11-22 19:34:15,376 INFO L226 Difference]: Without dead ends: 525 [2021-11-22 19:34:15,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:34:15,377 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 884 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:15,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 1357 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-11-22 19:34:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 423. [2021-11-22 19:34:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.11864406779661) internal successors, (462), 422 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 462 transitions. [2021-11-22 19:34:15,403 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 462 transitions. Word has length 87 [2021-11-22 19:34:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:15,403 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 462 transitions. [2021-11-22 19:34:15,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 462 transitions. [2021-11-22 19:34:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:34:15,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:15,405 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:34:15,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:34:15,405 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:34:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1467207477, now seen corresponding path program 1 times [2021-11-22 19:34:15,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:15,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727595904] [2021-11-22 19:34:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:15,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:15,667 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:15,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:15,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727595904] [2021-11-22 19:34:15,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727595904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:15,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:15,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:34:15,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806722630] [2021-11-22 19:34:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:15,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:34:15,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:34:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:34:15,670 INFO L87 Difference]: Start difference. First operand 423 states and 462 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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:34:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:16,167 INFO L93 Difference]: Finished difference Result 645 states and 707 transitions. [2021-11-22 19:34:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:34:16,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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:34:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:16,169 INFO L225 Difference]: With dead ends: 645 [2021-11-22 19:34:16,169 INFO L226 Difference]: Without dead ends: 572 [2021-11-22 19:34:16,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:34:16,170 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 337 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:16,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 1405 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-11-22 19:34:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 423. [2021-11-22 19:34:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.1210653753026634) internal successors, (463), 422 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 463 transitions. [2021-11-22 19:34:16,192 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 463 transitions. Word has length 87 [2021-11-22 19:34:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:16,193 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 463 transitions. [2021-11-22 19:34:16,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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:34:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 463 transitions. [2021-11-22 19:34:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:34:16,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:16,196 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:34:16,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:34:16,196 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:34:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 683816117, now seen corresponding path program 1 times [2021-11-22 19:34:16,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:16,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308636883] [2021-11-22 19:34:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:16,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:16,886 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:16,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308636883] [2021-11-22 19:34:16,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308636883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:16,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:16,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:34:16,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387422727] [2021-11-22 19:34:16,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:16,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:34:16,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:16,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:34:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:34:16,888 INFO L87 Difference]: Start difference. First operand 423 states and 463 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:34:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:17,252 INFO L93 Difference]: Finished difference Result 698 states and 766 transitions. [2021-11-22 19:34:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:34:17,252 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:34:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:17,254 INFO L225 Difference]: With dead ends: 698 [2021-11-22 19:34:17,254 INFO L226 Difference]: Without dead ends: 489 [2021-11-22 19:34:17,255 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:34:17,255 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 1235 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:17,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 776 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-11-22 19:34:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 372. [2021-11-22 19:34:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 362 states have (on average 1.1215469613259668) internal successors, (406), 371 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 406 transitions. [2021-11-22 19:34:17,276 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 406 transitions. Word has length 87 [2021-11-22 19:34:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:17,276 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 406 transitions. [2021-11-22 19:34:17,277 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:34:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 406 transitions. [2021-11-22 19:34:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:34:17,278 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:17,278 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:34:17,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:34:17,278 INFO L402 AbstractCegarLoop]: === Iteration 31 === 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:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash 686335484, now seen corresponding path program 1 times [2021-11-22 19:34:17,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:17,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873685447] [2021-11-22 19:34:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:17,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:17,942 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:17,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:17,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873685447] [2021-11-22 19:34:17,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873685447] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:17,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:17,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:34:17,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032152392] [2021-11-22 19:34:17,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:17,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:34:17,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:34:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:34:17,944 INFO L87 Difference]: Start difference. First operand 372 states and 406 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:34:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:18,796 INFO L93 Difference]: Finished difference Result 586 states and 640 transitions. [2021-11-22 19:34:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:34:18,796 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:34:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:18,797 INFO L225 Difference]: With dead ends: 586 [2021-11-22 19:34:18,797 INFO L226 Difference]: Without dead ends: 430 [2021-11-22 19:34:18,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:34:18,798 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1327 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:18,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 1654 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:34:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-22 19:34:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 329. [2021-11-22 19:34:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 319 states have (on average 1.1191222570532915) internal successors, (357), 328 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 357 transitions. [2021-11-22 19:34:18,813 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 357 transitions. Word has length 88 [2021-11-22 19:34:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:18,813 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 357 transitions. [2021-11-22 19:34:18,814 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:34:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 357 transitions. [2021-11-22 19:34:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 19:34:18,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:34:18,815 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:34:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash 606437774, now seen corresponding path program 1 times [2021-11-22 19:34:18,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658768784] [2021-11-22 19:34:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:18,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:19,124 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:19,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:19,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658768784] [2021-11-22 19:34:19,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658768784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:19,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:19,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:34:19,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817047992] [2021-11-22 19:34:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:19,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:34:19,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:34:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:34:19,126 INFO L87 Difference]: Start difference. First operand 329 states and 357 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:19,631 INFO L93 Difference]: Finished difference Result 532 states and 578 transitions. [2021-11-22 19:34:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:34:19,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-22 19:34:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:19,633 INFO L225 Difference]: With dead ends: 532 [2021-11-22 19:34:19,633 INFO L226 Difference]: Without dead ends: 457 [2021-11-22 19:34:19,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:34:19,634 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 524 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:19,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 1062 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-22 19:34:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 341. [2021-11-22 19:34:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.1178247734138973) internal successors, (370), 340 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:34:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 370 transitions. [2021-11-22 19:34:19,655 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 370 transitions. Word has length 89 [2021-11-22 19:34:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:19,656 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 370 transitions. [2021-11-22 19:34:19,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 370 transitions. [2021-11-22 19:34:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 19:34:19,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:19,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:19,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:34:19,657 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:34:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -613382386, now seen corresponding path program 1 times [2021-11-22 19:34:19,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:19,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823515028] [2021-11-22 19:34:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:19,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:20,114 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:20,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:20,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823515028] [2021-11-22 19:34:20,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823515028] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:20,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:20,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:34:20,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274501147] [2021-11-22 19:34:20,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:20,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:34:20,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:20,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:34:20,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:34:20,115 INFO L87 Difference]: Start difference. First operand 341 states and 370 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:20,711 INFO L93 Difference]: Finished difference Result 554 states and 603 transitions. [2021-11-22 19:34:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:34:20,711 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-22 19:34:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:20,712 INFO L225 Difference]: With dead ends: 554 [2021-11-22 19:34:20,712 INFO L226 Difference]: Without dead ends: 406 [2021-11-22 19:34:20,713 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:34:20,713 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 844 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:20,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [844 Valid, 1138 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-22 19:34:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 341. [2021-11-22 19:34:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.1148036253776434) internal successors, (369), 340 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:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 369 transitions. [2021-11-22 19:34:20,730 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 369 transitions. Word has length 89 [2021-11-22 19:34:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:20,730 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 369 transitions. [2021-11-22 19:34:20,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 369 transitions. [2021-11-22 19:34:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 19:34:20,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:20,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:34:20,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 19:34:20,731 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:34:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1992641168, now seen corresponding path program 1 times [2021-11-22 19:34:20,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803328985] [2021-11-22 19:34:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:20,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:21,224 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:21,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:21,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803328985] [2021-11-22 19:34:21,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803328985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:21,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:21,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:34:21,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753031993] [2021-11-22 19:34:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:21,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:34:21,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:21,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:34:21,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:34:21,226 INFO L87 Difference]: Start difference. First operand 341 states and 369 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:21,803 INFO L93 Difference]: Finished difference Result 510 states and 554 transitions. [2021-11-22 19:34:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:34:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-22 19:34:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:21,808 INFO L225 Difference]: With dead ends: 510 [2021-11-22 19:34:21,808 INFO L226 Difference]: Without dead ends: 352 [2021-11-22 19:34:21,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:34:21,810 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 892 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:21,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [892 Valid, 1302 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-22 19:34:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 314. [2021-11-22 19:34:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 304 states have (on average 1.111842105263158) internal successors, (338), 313 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 338 transitions. [2021-11-22 19:34:21,829 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 338 transitions. Word has length 89 [2021-11-22 19:34:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:21,829 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 338 transitions. [2021-11-22 19:34:21,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 338 transitions. [2021-11-22 19:34:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:34:21,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:21,831 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:34:21,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 19:34:21,831 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:34:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:21,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1801234922, now seen corresponding path program 1 times [2021-11-22 19:34:21,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553333557] [2021-11-22 19:34:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:21,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:23,073 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:23,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:23,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553333557] [2021-11-22 19:34:23,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553333557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:23,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:23,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-22 19:34:23,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006299796] [2021-11-22 19:34:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:23,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-22 19:34:23,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-22 19:34:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:34:23,076 INFO L87 Difference]: Start difference. First operand 314 states and 338 transitions. Second operand has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 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:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:25,304 INFO L93 Difference]: Finished difference Result 521 states and 565 transitions. [2021-11-22 19:34:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-22 19:34:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 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:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:25,305 INFO L225 Difference]: With dead ends: 521 [2021-11-22 19:34:25,306 INFO L226 Difference]: Without dead ends: 461 [2021-11-22 19:34:25,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2021-11-22 19:34:25,306 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 801 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:25,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [801 Valid, 3372 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-22 19:34:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-22 19:34:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 314. [2021-11-22 19:34:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 304 states have (on average 1.1085526315789473) internal successors, (337), 313 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 337 transitions. [2021-11-22 19:34:25,329 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 337 transitions. Word has length 90 [2021-11-22 19:34:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:25,329 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 337 transitions. [2021-11-22 19:34:25,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 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:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 337 transitions. [2021-11-22 19:34:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:34:25,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:25,330 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] [2021-11-22 19:34:25,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 19:34:25,331 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:34:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 192807151, now seen corresponding path program 1 times [2021-11-22 19:34:25,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:25,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790245169] [2021-11-22 19:34:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:25,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:26,306 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,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:26,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790245169] [2021-11-22 19:34:26,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790245169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:26,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:26,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:34:26,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208983365] [2021-11-22 19:34:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:26,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:34:26,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:26,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:34:26,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:34:26,308 INFO L87 Difference]: Start difference. First operand 314 states and 337 transitions. Second operand has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 21 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:28,513 INFO L93 Difference]: Finished difference Result 657 states and 710 transitions. [2021-11-22 19:34:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-22 19:34:28,513 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 21 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-22 19:34:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:28,515 INFO L225 Difference]: With dead ends: 657 [2021-11-22 19:34:28,515 INFO L226 Difference]: Without dead ends: 653 [2021-11-22 19:34:28,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=699, Invalid=3723, Unknown=0, NotChecked=0, Total=4422 [2021-11-22 19:34:28,516 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1448 mSDsluCounter, 3197 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:28,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1448 Valid, 3466 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:34:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-11-22 19:34:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 386. [2021-11-22 19:34:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 376 states have (on average 1.1090425531914894) internal successors, (417), 385 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 417 transitions. [2021-11-22 19:34:28,542 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 417 transitions. Word has length 92 [2021-11-22 19:34:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:28,542 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 417 transitions. [2021-11-22 19:34:28,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 21 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 417 transitions. [2021-11-22 19:34:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:34:28,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:28,544 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] [2021-11-22 19:34:28,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-22 19:34:28,544 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:34:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 208325869, now seen corresponding path program 1 times [2021-11-22 19:34:28,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:28,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012581989] [2021-11-22 19:34:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:28,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:28,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:28,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012581989] [2021-11-22 19:34:28,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012581989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:28,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:28,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:34:28,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418847129] [2021-11-22 19:34:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:28,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:34:28,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:28,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:34:28,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:34:28,931 INFO L87 Difference]: Start difference. First operand 386 states and 417 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:29,383 INFO L93 Difference]: Finished difference Result 643 states and 697 transitions. [2021-11-22 19:34:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:34:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-22 19:34:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:29,385 INFO L225 Difference]: With dead ends: 643 [2021-11-22 19:34:29,385 INFO L226 Difference]: Without dead ends: 499 [2021-11-22 19:34:29,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:34:29,386 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 803 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:29,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [803 Valid, 1151 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:34:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-11-22 19:34:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 386. [2021-11-22 19:34:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 376 states have (on average 1.1063829787234043) internal successors, (416), 385 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 416 transitions. [2021-11-22 19:34:29,415 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 416 transitions. Word has length 92 [2021-11-22 19:34:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:29,415 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 416 transitions. [2021-11-22 19:34:29,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 416 transitions. [2021-11-22 19:34:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:34:29,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:29,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, 1, 1, 1, 1] [2021-11-22 19:34:29,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-22 19:34:29,417 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:34:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1480617873, now seen corresponding path program 1 times [2021-11-22 19:34:29,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:29,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593913557] [2021-11-22 19:34:29,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:29,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:29,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:29,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593913557] [2021-11-22 19:34:29,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593913557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:29,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:29,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:34:29,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553501154] [2021-11-22 19:34:29,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:29,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:34:29,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:34:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:34:29,874 INFO L87 Difference]: Start difference. First operand 386 states and 416 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:30,483 INFO L93 Difference]: Finished difference Result 532 states and 579 transitions. [2021-11-22 19:34:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:34:30,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-22 19:34:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:30,484 INFO L225 Difference]: With dead ends: 532 [2021-11-22 19:34:30,484 INFO L226 Difference]: Without dead ends: 306 [2021-11-22 19:34:30,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:34:30,488 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 253 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:30,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1428 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-22 19:34:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-11-22 19:34:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 297 states have (on average 1.1077441077441077) internal successors, (329), 305 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 329 transitions. [2021-11-22 19:34:30,510 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 329 transitions. Word has length 92 [2021-11-22 19:34:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:30,510 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 329 transitions. [2021-11-22 19:34:30,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 329 transitions. [2021-11-22 19:34:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:34:30,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:30,512 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:30,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-22 19:34:30,513 INFO L402 AbstractCegarLoop]: === Iteration 39 === 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:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1328469076, now seen corresponding path program 1 times [2021-11-22 19:34:30,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063335004] [2021-11-22 19:34:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:30,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:30,672 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:30,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:30,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063335004] [2021-11-22 19:34:30,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063335004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:30,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:30,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:34:30,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137588017] [2021-11-22 19:34:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:30,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:34:30,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:34:30,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:34:30,675 INFO L87 Difference]: Start difference. First operand 306 states and 329 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:30,726 INFO L93 Difference]: Finished difference Result 443 states and 479 transitions. [2021-11-22 19:34:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:34:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:30,728 INFO L225 Difference]: With dead ends: 443 [2021-11-22 19:34:30,728 INFO L226 Difference]: Without dead ends: 338 [2021-11-22 19:34:30,728 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:30,729 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 221 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:30,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 691 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:34:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-22 19:34:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 281. [2021-11-22 19:34:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 272 states have (on average 1.1029411764705883) internal successors, (300), 280 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 300 transitions. [2021-11-22 19:34:30,747 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 300 transitions. Word has length 97 [2021-11-22 19:34:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:30,747 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 300 transitions. [2021-11-22 19:34:30,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 300 transitions. [2021-11-22 19:34:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:34:30,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:30,749 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:30,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-22 19:34:30,749 INFO L402 AbstractCegarLoop]: === Iteration 40 === 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:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1393361552, now seen corresponding path program 1 times [2021-11-22 19:34:30,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:30,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217212067] [2021-11-22 19:34:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:30,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:30,962 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:30,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217212067] [2021-11-22 19:34:30,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217212067] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:34:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42022627] [2021-11-22 19:34:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:30,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:34:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:34:30,970 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:30,985 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:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:31,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-22 19:34:31,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:34:31,648 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:31,756 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:34:31,756 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:31,784 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:31,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:31,908 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,289 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-22 19:34:32,289 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 43 treesize of output 42 [2021-11-22 19:34:32,304 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 19:34:32,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2021-11-22 19:34:32,322 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:32,651 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:34:32,732 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:34:32,733 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:32,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:32,789 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,856 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:32,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:34:32,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 Int) (v_ArrVal_2011 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2011) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2013) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:34:33,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 Int) (v_ArrVal_2011 (Array Int 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_2011) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2013) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:34:33,155 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2013 Int) (v_ArrVal_2011 (Array Int 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_2011) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2013) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:34:33,165 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2013 Int) (v_ArrVal_2011 (Array Int 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_2011) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2013) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) (= (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,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2008 (Array Int Int)) (v_ArrVal_2013 Int) (v_ArrVal_2011 (Array Int Int)) (v_ArrVal_2009 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| v_ArrVal_2008)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 16))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset| v_ArrVal_2009)) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 8)) v_ArrVal_2011) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| v_ArrVal_2013) .cse1) 18446744073709551616) 0))))) is different from false [2021-11-22 19:34:33,470 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2008 (Array Int Int)) (v_ArrVal_2013 Int) (v_ArrVal_2011 (Array Int Int)) (v_ArrVal_2009 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| v_ArrVal_2008)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 16))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset| v_ArrVal_2009)) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 8)) v_ArrVal_2011) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| v_ArrVal_2013) .cse1) 18446744073709551616) 0))))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:34:33,493 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:33,493 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 303 treesize of output 303 [2021-11-22 19:34:33,497 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 337 treesize of output 325 [2021-11-22 19:34:33,505 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 393 treesize of output 377 [2021-11-22 19:34:33,528 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 9 treesize of output 5 [2021-11-22 19:34:33,549 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:33,550 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 398 treesize of output 394 [2021-11-22 19:34:35,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7| Int) (v_ArrVal_2009 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7|) |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7| v_ArrVal_2009)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7|))) is different from false [2021-11-22 19:34:35,499 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 96 treesize of output 90 [2021-11-22 19:34:35,807 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:35,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42022627] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:34:35,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:34:35,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 16] total 35 [2021-11-22 19:34:35,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105547855] [2021-11-22 19:34:35,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:34:35,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-22 19:34:35,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-22 19:34:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=680, Unknown=7, NotChecked=406, Total=1190 [2021-11-22 19:34:35,809 INFO L87 Difference]: Start difference. First operand 281 states and 300 transitions. Second operand has 35 states, 35 states have (on average 7.6571428571428575) internal successors, (268), 35 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:34:36,520 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7| Int) (v_ArrVal_2009 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7|) |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7| v_ArrVal_2009)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7|))) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:34:37,123 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7| Int) (v_ArrVal_2009 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_7|) |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7| v_ArrVal_2009)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_7|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:34:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:38,818 INFO L93 Difference]: Finished difference Result 598 states and 649 transitions. [2021-11-22 19:34:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:34:38,818 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.6571428571428575) internal successors, (268), 35 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) Word has length 99 [2021-11-22 19:34:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:38,819 INFO L225 Difference]: With dead ends: 598 [2021-11-22 19:34:38,820 INFO L226 Difference]: Without dead ends: 497 [2021-11-22 19:34:38,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 170 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=353, Invalid=1744, Unknown=9, NotChecked=864, Total=2970 [2021-11-22 19:34:38,821 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1052 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2390 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:38,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1052 Valid, 4454 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1369 Invalid, 0 Unknown, 2390 Unchecked, 0.9s Time] [2021-11-22 19:34:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-22 19:34:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 299. [2021-11-22 19:34:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 290 states have (on average 1.1) internal successors, (319), 298 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 319 transitions. [2021-11-22 19:34:38,843 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 319 transitions. Word has length 99 [2021-11-22 19:34:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:38,844 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 319 transitions. [2021-11-22 19:34:38,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.6571428571428575) internal successors, (268), 35 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:34:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 319 transitions. [2021-11-22 19:34:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:34:38,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:38,845 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:38,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 19:34:39,067 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,SelfDestructingSolverStorable39 [2021-11-22 19:34:39,067 INFO L402 AbstractCegarLoop]: === Iteration 41 === 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:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1716671773, now seen corresponding path program 1 times [2021-11-22 19:34:39,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:39,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634068404] [2021-11-22 19:34:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:39,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:41,795 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:41,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:41,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634068404] [2021-11-22 19:34:41,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634068404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:41,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:41,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:34:41,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316507621] [2021-11-22 19:34:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:41,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:34:41,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:41,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:34:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:34:41,798 INFO L87 Difference]: Start difference. First operand 299 states and 319 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 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:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:42,563 INFO L93 Difference]: Finished difference Result 342 states and 366 transitions. [2021-11-22 19:34:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:34:42,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 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:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:42,566 INFO L225 Difference]: With dead ends: 342 [2021-11-22 19:34:42,566 INFO L226 Difference]: Without dead ends: 340 [2021-11-22 19:34:42,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:34:42,567 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 756 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:42,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 1026 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:34:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-22 19:34:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 301. [2021-11-22 19:34:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 292 states have (on average 1.0993150684931507) internal successors, (321), 300 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2021-11-22 19:34:42,585 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 99 [2021-11-22 19:34:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:42,585 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2021-11-22 19:34:42,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 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:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2021-11-22 19:34:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 19:34:42,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:42,587 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:34:42,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-22 19:34:42,587 INFO L402 AbstractCegarLoop]: === Iteration 42 === 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:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1000539932, now seen corresponding path program 1 times [2021-11-22 19:34:42,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:42,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893146007] [2021-11-22 19:34:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:42,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:42,910 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:42,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893146007] [2021-11-22 19:34:42,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893146007] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:42,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:42,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:34:42,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430339623] [2021-11-22 19:34:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:42,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:34:42,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:34:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:34:42,912 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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:34:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:43,173 INFO L93 Difference]: Finished difference Result 429 states and 460 transitions. [2021-11-22 19:34:43,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:34:43,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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:34:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:43,174 INFO L225 Difference]: With dead ends: 429 [2021-11-22 19:34:43,174 INFO L226 Difference]: Without dead ends: 370 [2021-11-22 19:34:43,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:34:43,175 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 316 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:43,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 859 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-11-22 19:34:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 311. [2021-11-22 19:34:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 302 states have (on average 1.096026490066225) internal successors, (331), 310 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 331 transitions. [2021-11-22 19:34:43,197 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 331 transitions. Word has length 100 [2021-11-22 19:34:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:43,197 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 331 transitions. [2021-11-22 19:34:43,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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:34:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 331 transitions. [2021-11-22 19:34:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 19:34:43,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:43,198 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:34:43,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-22 19:34:43,199 INFO L402 AbstractCegarLoop]: === Iteration 43 === 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:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash -20528422, now seen corresponding path program 1 times [2021-11-22 19:34:43,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:43,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632466824] [2021-11-22 19:34:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:43,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:43,864 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:43,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:43,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632466824] [2021-11-22 19:34:43,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632466824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:43,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:43,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:34:43,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055968353] [2021-11-22 19:34:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:43,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:34:43,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:34:43,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:34:43,866 INFO L87 Difference]: Start difference. First operand 311 states and 331 transitions. Second operand has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 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:34:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:44,384 INFO L93 Difference]: Finished difference Result 387 states and 414 transitions. [2021-11-22 19:34:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:34:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 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:34:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:44,386 INFO L225 Difference]: With dead ends: 387 [2021-11-22 19:34:44,386 INFO L226 Difference]: Without dead ends: 385 [2021-11-22 19:34:44,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:34:44,387 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 699 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:44,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 1010 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:34:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-22 19:34:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 315. [2021-11-22 19:34:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 306 states have (on average 1.0980392156862746) internal successors, (336), 314 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 336 transitions. [2021-11-22 19:34:44,412 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 336 transitions. Word has length 100 [2021-11-22 19:34:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:44,413 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 336 transitions. [2021-11-22 19:34:44,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 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:34:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 336 transitions. [2021-11-22 19:34:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 19:34:44,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:44,415 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:34:44,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-22 19:34:44,415 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:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1566218728, now seen corresponding path program 1 times [2021-11-22 19:34:44,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:44,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420119480] [2021-11-22 19:34:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:44,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:34:44,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:44,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420119480] [2021-11-22 19:34:44,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420119480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:34:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822219577] [2021-11-22 19:34:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:44,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:34:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:34:44,644 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:44,647 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:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:45,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 2811 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-22 19:34:45,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:34:45,209 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:45,281 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:34:45,281 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:45,304 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:45,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:45,403 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:45,550 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-22 19:34:45,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-22 19:34:45,768 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:34:45,858 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:34:45,900 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:34:45,901 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:34:45,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:34:45,963 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:45,963 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:34:46,083 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:46,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:34:46,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2330 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2330) |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:34:46,215 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_write_#t~short1171#1| (forall ((v_ArrVal_2330 (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_2330) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|) |c_ULTIMATE.start_aws_byte_buf_write_~len#1|))) (<= (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:34:46,220 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:34:46,229 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:34:46,229 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:34:46,242 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:34:46,242 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:34:47,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8| Int) (v_ArrVal_2327 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8|) |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8| v_ArrVal_2327)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8|))) is different from false [2021-11-22 19:34:47,546 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:34:47,840 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:34:47,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822219577] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:34:47,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:34:47,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 29 [2021-11-22 19:34:47,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684326613] [2021-11-22 19:34:47,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:34:47,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-22 19:34:47,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-22 19:34:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=584, Unknown=3, NotChecked=150, Total=812 [2021-11-22 19:34:47,841 INFO L87 Difference]: Start difference. First operand 315 states and 336 transitions. Second operand has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:48,642 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8| Int) (v_ArrVal_2327 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8|) |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8| v_ArrVal_2327)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8|))) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:34:49,239 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8| Int) (v_ArrVal_2327 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_8|) |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8| v_ArrVal_2327)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset_8|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:34:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:50,208 INFO L93 Difference]: Finished difference Result 569 states and 617 transitions. [2021-11-22 19:34:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 19:34:50,209 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 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:34:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:50,210 INFO L225 Difference]: With dead ends: 569 [2021-11-22 19:34:50,210 INFO L226 Difference]: Without dead ends: 463 [2021-11-22 19:34:50,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=184, Invalid=1391, Unknown=5, NotChecked=400, Total=1980 [2021-11-22 19:34:50,211 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 467 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 737 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:50,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 2846 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 581 Invalid, 0 Unknown, 737 Unchecked, 0.4s Time] [2021-11-22 19:34:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-11-22 19:34:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 326. [2021-11-22 19:34:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 317 states have (on average 1.0946372239747635) internal successors, (347), 325 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:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2021-11-22 19:34:50,234 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 101 [2021-11-22 19:34:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:50,235 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2021-11-22 19:34:50,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2021-11-22 19:34:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 19:34:50,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:50,236 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] [2021-11-22 19:34:50,264 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:34:50,455 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,SelfDestructingSolverStorable43 [2021-11-22 19:34:50,456 INFO L402 AbstractCegarLoop]: === Iteration 45 === 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:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 454271519, now seen corresponding path program 1 times [2021-11-22 19:34:50,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912384051] [2021-11-22 19:34:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:50,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:51,648 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:51,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:51,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912384051] [2021-11-22 19:34:51,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912384051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:51,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:51,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:34:51,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790130499] [2021-11-22 19:34:51,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:51,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:34:51,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:34:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:34:51,649 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:52,043 INFO L93 Difference]: Finished difference Result 390 states and 418 transitions. [2021-11-22 19:34:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:34:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 19:34:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:52,045 INFO L225 Difference]: With dead ends: 390 [2021-11-22 19:34:52,045 INFO L226 Difference]: Without dead ends: 388 [2021-11-22 19:34:52,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:34:52,046 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 911 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:52,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [911 Valid, 1275 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-22 19:34:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 328. [2021-11-22 19:34:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 319 states have (on average 1.0940438871473355) internal successors, (349), 327 states have internal predecessors, (349), 0 states have call successors, (0), 0 states 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:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 349 transitions. [2021-11-22 19:34:52,070 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 349 transitions. Word has length 101 [2021-11-22 19:34:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:52,070 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 349 transitions. [2021-11-22 19:34:52,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:34:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 349 transitions. [2021-11-22 19:34:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 19:34:52,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:52,071 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:34:52,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-22 19:34:52,072 INFO L402 AbstractCegarLoop]: === Iteration 46 === 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:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1747161980, now seen corresponding path program 1 times [2021-11-22 19:34:52,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:52,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946622035] [2021-11-22 19:34:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:52,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:54,024 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:54,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:54,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946622035] [2021-11-22 19:34:54,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946622035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:54,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:54,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-22 19:34:54,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235894171] [2021-11-22 19:34:54,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:54,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-22 19:34:54,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-22 19:34:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:34:54,026 INFO L87 Difference]: Start difference. First operand 328 states and 349 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 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:34:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:55,560 INFO L93 Difference]: Finished difference Result 428 states and 458 transitions. [2021-11-22 19:34:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:34:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 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:34:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:55,561 INFO L225 Difference]: With dead ends: 428 [2021-11-22 19:34:55,562 INFO L226 Difference]: Without dead ends: 360 [2021-11-22 19:34:55,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2021-11-22 19:34:55,564 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 634 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:55,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 1811 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 19:34:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-22 19:34:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 317. [2021-11-22 19:34:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 308 states have (on average 1.094155844155844) internal successors, (337), 316 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 337 transitions. [2021-11-22 19:34:55,582 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 337 transitions. Word has length 102 [2021-11-22 19:34:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:55,583 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 337 transitions. [2021-11-22 19:34:55,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 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:34:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 337 transitions. [2021-11-22 19:34:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 19:34:55,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:55,584 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:34:55,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-22 19:34:55,584 INFO L402 AbstractCegarLoop]: === Iteration 47 === 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:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 832542784, now seen corresponding path program 1 times [2021-11-22 19:34:55,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:55,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776317089] [2021-11-22 19:34:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:55,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:55,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:34:55,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776317089] [2021-11-22 19:34:55,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776317089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:55,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:55,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:34:55,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363370339] [2021-11-22 19:34:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:55,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:34:55,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:34:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:34:55,922 INFO L87 Difference]: Start difference. First operand 317 states and 337 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 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:34:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:34:56,213 INFO L93 Difference]: Finished difference Result 448 states and 479 transitions. [2021-11-22 19:34:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:34:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 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:34:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:34:56,215 INFO L225 Difference]: With dead ends: 448 [2021-11-22 19:34:56,215 INFO L226 Difference]: Without dead ends: 391 [2021-11-22 19:34:56,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:34:56,216 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 372 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:34:56,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 932 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:34:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-11-22 19:34:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 317. [2021-11-22 19:34:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 308 states have (on average 1.0909090909090908) internal successors, (336), 316 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 336 transitions. [2021-11-22 19:34:56,241 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 336 transitions. Word has length 102 [2021-11-22 19:34:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:34:56,242 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 336 transitions. [2021-11-22 19:34:56,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 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:34:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 336 transitions. [2021-11-22 19:34:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 19:34:56,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:34:56,243 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:34:56,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-22 19:34:56,244 INFO L402 AbstractCegarLoop]: === Iteration 48 === 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:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:34:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1161601922, now seen corresponding path program 1 times [2021-11-22 19:34:56,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:34:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009936290] [2021-11-22 19:34:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:34:56,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:34:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:34:59,113 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:59,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:34:59,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009936290] [2021-11-22 19:34:59,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009936290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:34:59,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:34:59,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:34:59,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883974116] [2021-11-22 19:34:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:34:59,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:34:59,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:34:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:34:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:34:59,115 INFO L87 Difference]: Start difference. First operand 317 states and 336 transitions. Second operand has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 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:35:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:35:00,655 INFO L93 Difference]: Finished difference Result 414 states and 441 transitions. [2021-11-22 19:35:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:35:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 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:35:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:35:00,656 INFO L225 Difference]: With dead ends: 414 [2021-11-22 19:35:00,657 INFO L226 Difference]: Without dead ends: 412 [2021-11-22 19:35:00,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2021-11-22 19:35:00,657 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 919 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:35:00,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [919 Valid, 1541 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:35:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-11-22 19:35:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 319. [2021-11-22 19:35:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 310 states have (on average 1.0903225806451613) internal successors, (338), 318 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:35:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 338 transitions. [2021-11-22 19:35:00,683 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 338 transitions. Word has length 102 [2021-11-22 19:35:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:35:00,683 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 338 transitions. [2021-11-22 19:35:00,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 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:35:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 338 transitions. [2021-11-22 19:35:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 19:35:00,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:35:00,685 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, 1, 1] [2021-11-22 19:35:00,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-22 19:35:00,685 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:35:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:35:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 392189248, now seen corresponding path program 1 times [2021-11-22 19:35:00,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:35:00,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970208314] [2021-11-22 19:35:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:00,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:35:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:35:01,487 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:35:01,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:35:01,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970208314] [2021-11-22 19:35:01,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970208314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:35:01,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:35:01,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:35:01,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711781207] [2021-11-22 19:35:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:35:01,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:35:01,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:35:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:35:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:35:01,489 INFO L87 Difference]: Start difference. First operand 319 states and 338 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:35:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:35:01,954 INFO L93 Difference]: Finished difference Result 383 states and 409 transitions. [2021-11-22 19:35:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:35:01,955 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2021-11-22 19:35:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:35:01,956 INFO L225 Difference]: With dead ends: 383 [2021-11-22 19:35:01,956 INFO L226 Difference]: Without dead ends: 381 [2021-11-22 19:35:01,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:35:01,956 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 530 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:35:01,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 1086 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:35:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-22 19:35:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 303. [2021-11-22 19:35:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 294 states have (on average 1.0918367346938775) internal successors, (321), 302 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:35:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 321 transitions. [2021-11-22 19:35:01,976 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 321 transitions. Word has length 104 [2021-11-22 19:35:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:35:01,976 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 321 transitions. [2021-11-22 19:35:01,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:35:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 321 transitions. [2021-11-22 19:35:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-22 19:35:01,977 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:35:01,978 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:01,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-22 19:35:01,978 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:35:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:35:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2068554433, now seen corresponding path program 1 times [2021-11-22 19:35:01,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:35:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396255382] [2021-11-22 19:35:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:01,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:35:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:35:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:35:02,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:35:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396255382] [2021-11-22 19:35:02,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396255382] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:35:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568205866] [2021-11-22 19:35:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:02,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:35:02,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:35:02,208 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:35:02,211 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:35:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:35:02,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-22 19:35:02,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:35:02,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:35:02,846 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:35:02,847 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:35:02,880 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 22 treesize of output 18 [2021-11-22 19:35:03,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:03,176 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:35:03,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:03,384 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:35:03,649 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:35:03,649 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:35:03,678 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:35:03,678 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:35:03,702 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:35:03,702 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:35:03,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:03,741 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:35:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-22 19:35:03,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:35:04,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2792 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2790) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2792) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 0))) is different from false [2021-11-22 19:35:04,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2792 Int) (v_ArrVal_2790 (Array Int 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_2790) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2792) .cse0)) 0))) is different from false [2021-11-22 19:35:04,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset| v_ArrVal_2787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) .cse1) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| v_ArrVal_2792) .cse1)) 0))) is different from false [2021-11-22 19:35:04,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse1)) 0))) is different from false [2021-11-22 19:35:04,246 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse1)) 0))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) is different from false [2021-11-22 19:35:04,254 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse1)) 0)))) is different from false [2021-11-22 19:35:04,555 INFO L354 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2021-11-22 19:35:04,556 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 534 treesize of output 360 [2021-11-22 19:35:04,577 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:04,577 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 528 treesize of output 516 [2021-11-22 19:35:04,582 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 636 treesize of output 604 [2021-11-22 19:35:04,749 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:35:04,913 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:04,914 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 411 treesize of output 395 [2021-11-22 19:35:05,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:35:05,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:05,206 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-11-22 19:35:05,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:35:05,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:05,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2021-11-22 19:35:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2021-11-22 19:35:05,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568205866] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:35:05,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:35:05,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22, 23] total 45 [2021-11-22 19:35:05,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358060797] [2021-11-22 19:35:05,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:35:05,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-22 19:35:05,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:35:05,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-22 19:35:05,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1358, Unknown=6, NotChecked=474, Total=1980 [2021-11-22 19:35:05,593 INFO L87 Difference]: Start difference. First operand 303 states and 321 transitions. Second operand has 45 states, 45 states have (on average 6.7555555555555555) internal successors, (304), 45 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:35:05,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)))) (and (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset|) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse2) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse2)) 0))))) is different from false [2021-11-22 19:35:05,693 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)))) (and (not (= .cse0 0)) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse2) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse2)) 0))))) is different from false [2021-11-22 19:35:05,792 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)))) (and (or (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse1)) 0)))) (not (= .cse2 0)) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:35:05,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)))) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (or (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| Int) (v_ArrVal_2792 Int) (v_ArrVal_2787 Int) (v_ArrVal_2790 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_9|) 0 v_ArrVal_2787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2790)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| v_ArrVal_2792) .cse1)) 0))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) (not (= .cse2 0)) (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:35:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:35:07,312 INFO L93 Difference]: Finished difference Result 559 states and 604 transitions. [2021-11-22 19:35:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-22 19:35:07,312 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.7555555555555555) internal successors, (304), 45 states have internal predecessors, (304), 0 states have call successors, (0), 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 105 [2021-11-22 19:35:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:35:07,313 INFO L225 Difference]: With dead ends: 559 [2021-11-22 19:35:07,313 INFO L226 Difference]: Without dead ends: 446 [2021-11-22 19:35:07,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=428, Invalid=4855, Unknown=13, NotChecked=1510, Total=6806 [2021-11-22 19:35:07,316 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 409 mSDsluCounter, 4570 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 4751 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1981 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:35:07,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 4751 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1084 Invalid, 0 Unknown, 1981 Unchecked, 0.5s Time] [2021-11-22 19:35:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-11-22 19:35:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 308. [2021-11-22 19:35:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.0936454849498327) internal successors, (327), 307 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:35:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 327 transitions. [2021-11-22 19:35:07,355 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 327 transitions. Word has length 105 [2021-11-22 19:35:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:35:07,356 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 327 transitions. [2021-11-22 19:35:07,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.7555555555555555) internal successors, (304), 45 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:35:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 327 transitions. [2021-11-22 19:35:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-22 19:35:07,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:35:07,357 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, 1, 1, 1] [2021-11-22 19:35:07,383 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:35:07,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:35:07,571 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:35:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:35:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1311183076, now seen corresponding path program 1 times [2021-11-22 19:35:07,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:35:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643746390] [2021-11-22 19:35:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:07,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:35:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:35:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:35:08,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:35:08,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643746390] [2021-11-22 19:35:08,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643746390] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:35:08,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:35:08,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:35:08,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382230327] [2021-11-22 19:35:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:35:08,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:35:08,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:35:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:35:08,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:35:08,294 INFO L87 Difference]: Start difference. First operand 308 states and 327 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:35:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:35:09,031 INFO L93 Difference]: Finished difference Result 388 states and 414 transitions. [2021-11-22 19:35:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:35:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2021-11-22 19:35:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:35:09,033 INFO L225 Difference]: With dead ends: 388 [2021-11-22 19:35:09,033 INFO L226 Difference]: Without dead ends: 355 [2021-11-22 19:35:09,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:35:09,034 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 1060 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:35:09,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1060 Valid, 1633 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:35:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-11-22 19:35:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 328. [2021-11-22 19:35:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 319 states have (on average 1.0909090909090908) internal successors, (348), 327 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:35:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 348 transitions. [2021-11-22 19:35:09,062 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 348 transitions. Word has length 105 [2021-11-22 19:35:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:35:09,063 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 348 transitions. [2021-11-22 19:35:09,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:35:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 348 transitions. [2021-11-22 19:35:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-22 19:35:09,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:35:09,064 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:09,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-22 19:35:09,064 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:35:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:35:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -557996275, now seen corresponding path program 1 times [2021-11-22 19:35:09,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:35:09,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745673533] [2021-11-22 19:35:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:09,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:35:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:35:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:35:09,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:35:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745673533] [2021-11-22 19:35:09,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745673533] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:35:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453725819] [2021-11-22 19:35:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:09,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:35:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:35:09,304 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:35:09,305 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:35:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:35:09,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 2908 conjuncts, 113 conjunts are in the unsatisfiable core [2021-11-22 19:35:09,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:35:09,826 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:35:09,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:09,947 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:35:09,968 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:35:10,105 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-22 19:35:10,105 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 20 treesize of output 22 [2021-11-22 19:35:10,134 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 18 treesize of output 20 [2021-11-22 19:35:10,155 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:35:10,155 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:35:10,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:10,188 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:35:10,596 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 19:35:10,596 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 41 treesize of output 47 [2021-11-22 19:35:10,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:10,599 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 42 treesize of output 41 [2021-11-22 19:35:10,608 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:35:10,880 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 21 treesize of output 9 [2021-11-22 19:35:10,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:10,965 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:35:10,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:10,995 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:35:11,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:11,015 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:35:11,040 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:35:11,040 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 24 treesize of output 26 [2021-11-22 19:35:11,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:35:11,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 24 treesize of output 23 [2021-11-22 19:35:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 19:35:11,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:35:11,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 Int)) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_3057) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3059) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:35:11,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 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_3057) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3059) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:35:11,395 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 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_3057) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3059) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:35:11,403 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 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_3057) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_3059) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) (= (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:35:11,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 Int) (v_ArrVal_3053 Int) (v_ArrVal_3051 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| v_ArrVal_3051)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 16))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset| v_ArrVal_3053)) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 8)) v_ArrVal_3057) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| v_ArrVal_3059) .cse1) 18446744073709551616) 0))))) is different from false [2021-11-22 19:35:11,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 Int) (v_ArrVal_3051 (Array Int Int)) (v_ArrVal_3053 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| v_ArrVal_3051)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 16))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset| v_ArrVal_3053)) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 8)) v_ArrVal_3057) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| v_ArrVal_3059) .cse1) 18446744073709551616) 0))))) is different from false [2021-11-22 19:35:11,668 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 Int) (v_ArrVal_3051 (Array Int Int)) (v_ArrVal_3053 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| v_ArrVal_3051)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 16))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.offset| v_ArrVal_3053)) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| 8)) v_ArrVal_3057) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_be64_~buf#1.offset| v_ArrVal_3059) .cse1) 18446744073709551616) 0))))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:35:11,684 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:11,684 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 303 treesize of output 303 [2021-11-22 19:35:11,688 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 337 treesize of output 325 [2021-11-22 19:35:11,691 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 393 treesize of output 377 [2021-11-22 19:35:11,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 9 treesize of output 5 [2021-11-22 19:35:11,761 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:11,761 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 28 treesize of output 32 [2021-11-22 19:35:12,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| Int) (v_ArrVal_3053 Int)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10|) 0 v_ArrVal_3053)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))))) is different from false [2021-11-22 19:35:12,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| Int) (v_ArrVal_3048 (Array Int Int)) (v_ArrVal_3053 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3048))) (store .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| (store (select .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10|) 0 v_ArrVal_3053))) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|))) is different from false [2021-11-22 19:35:13,218 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:13,218 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 60 treesize of output 50 [2021-11-22 19:35:13,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:13,231 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 180 treesize of output 194 [2021-11-22 19:35:13,234 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 224 treesize of output 208 [2021-11-22 19:35:13,426 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 26 treesize of output 22 [2021-11-22 19:35:13,434 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 19:35:13,471 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:13,471 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 50 treesize of output 50 [2021-11-22 19:35:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2021-11-22 19:35:14,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453725819] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:35:14,664 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:35:14,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 19] total 44 [2021-11-22 19:35:14,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781792249] [2021-11-22 19:35:14,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:35:14,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-22 19:35:14,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:35:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-22 19:35:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1093, Unknown=9, NotChecked=666, Total=1892 [2021-11-22 19:35:14,672 INFO L87 Difference]: Start difference. First operand 328 states and 348 transitions. Second operand has 44 states, 44 states have (on average 6.5227272727272725) internal successors, (287), 44 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:35:14,845 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| Int) (v_ArrVal_3048 (Array Int Int)) (v_ArrVal_3053 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3048))) (store .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| (store (select .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10|) 0 v_ArrVal_3053))) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:35:14,849 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| Int) (v_ArrVal_3048 (Array Int Int)) (v_ArrVal_3053 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3048))) (store .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| (store (select .cse0 |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10|) 0 v_ArrVal_3053))) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|))) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:35:15,422 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| Int) (v_ArrVal_3053 Int)) (not (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_be64_~#x#1.base_10|) 0 v_ArrVal_3053)) |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 8))))) (= |c_ULTIMATE.start_aws_byte_buf_write_be64_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:35:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:35:17,243 INFO L93 Difference]: Finished difference Result 530 states and 570 transitions. [2021-11-22 19:35:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-22 19:35:17,244 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.5227272727272725) internal successors, (287), 44 states have internal predecessors, (287), 0 states have call successors, (0), 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 108 [2021-11-22 19:35:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:35:17,245 INFO L225 Difference]: With dead ends: 530 [2021-11-22 19:35:17,245 INFO L226 Difference]: Without dead ends: 416 [2021-11-22 19:35:17,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=450, Invalid=3126, Unknown=12, NotChecked=1524, Total=5112 [2021-11-22 19:35:17,246 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 755 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 5056 SdHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3450 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:35:17,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [755 Valid, 5056 Invalid, 4691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1188 Invalid, 0 Unknown, 3450 Unchecked, 0.7s Time] [2021-11-22 19:35:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-11-22 19:35:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 323. [2021-11-22 19:35:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 314 states have (on average 1.0828025477707006) internal successors, (340), 322 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:35:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 340 transitions. [2021-11-22 19:35:17,273 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 340 transitions. Word has length 108 [2021-11-22 19:35:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:35:17,273 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 340 transitions. [2021-11-22 19:35:17,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.5227272727272725) internal successors, (287), 44 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:35:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 340 transitions. [2021-11-22 19:35:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-22 19:35:17,274 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:35:17,274 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, 1, 1, 1, 1, 1, 1] [2021-11-22 19:35:17,304 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:35:17,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:35:17,492 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:35:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:35:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash 548621189, now seen corresponding path program 1 times [2021-11-22 19:35:17,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:35:17,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678877359] [2021-11-22 19:35:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:35:17,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:35:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:39:22,962 WARN L227 SmtUtils]: Spent 18.76s on a formula simplification. DAG size of input: 269 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 19:42:23,317 WARN L227 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 29 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15